Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
| Year of publication: |
2009
|
|---|---|
| Authors: | Burer, Samuel ; Vandenbussche, Dieter |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 43.2009, 2, p. 181-195
|
| Publisher: |
Springer |
| Subject: | Nonconcave quadratic maximization | Nonconvex quadratic programming | Branch-and-bound | Lift-and-project relaxations | Semidefinite programming |
-
Faster, but weaker, relaxations for quadratically constrained quadratic programs
Burer, Samuel, (2014)
-
Finding largest small polygons with GloptiPoly
Henrion, Didier, (2013)
-
SDP reformulation for robust optimization problems based on nonconvex QP duality
Nishimura, Ryoichi, (2013)
- More ...
-
Burer, Samuel, (2009)
-
Campbell, Ann Melissa, (2008)
-
Stubbs, Robert A., (2010)
- More ...