✦ LIBER ✦

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

✍ Scribed by Xiaowei Bao; Nikolaos V. Sahinidis; Mohit Tawarmalani

Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 573 KB
Volume: 129
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-011-0462-2

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

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

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

A finite branch-and-bound algorithm for

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

✍ Samuel Burer; Dieter Vandenbussche 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

Quadratically constrained quadratic prog

Quadratically constrained quadratic programming: Some applications and a method for solution

✍ E. Phan-huy-Hao 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 659 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