✦ LIBER ✦

Hidden convexity in some nonconvex quadratically constrained quadratic programming

✍ Scribed by Aharon Ben-Tal; Marc Teboulle

Book ID: 110573270
Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 538 KB
Volume: 72
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf02592331

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A relaxation method for nonconvex quadra

A relaxation method for nonconvex quadratically constrained quadratic programs

✍ Faiz A. Al-Khayyal; Christian Larsen; Timothy Van Voorhis 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 806 KB

Convex relaxations for nonconvex quadrat

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

✍ Xiao Jin Zheng; Xiao Ling Sun; Duan Li 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 321 KB

Robust convex quadratically constrained

Robust convex quadratically constrained programs

✍ D. Goldfarb; G. Iyengar 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

On convex relaxations for quadratically

On convex relaxations for quadratically constrained quadratic programming

✍ Kurt M. Anstreicher 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 328 KB

A branch and cut algorithm for nonconvex

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

✍ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

We present a branch and cut algorithm that yields in finite time, a globally ☼-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra

Semidefinite programming versus the refo

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

✍ Kurt M. Anstreicher 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 464 KB