A new global optimization scheme for quadratic programs with low-rank nonconvexity
Year of publication: |
2021
|
---|---|
Authors: | Cen, Xiaoli ; Xia, Yong |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 4, p. 1368-1383
|
Subject: | branch and bound | quadratic programming | quadratically constrained quadratic programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
On the extensions of Frank-Wolfe theorem
Luo, Zhi-Quan, (1997)
-
Generating cutting planes for the semidefinite relaxation of quadratic programs
Gorge, Agnès, (2015)
-
On solving quadratically contrained quadratic programming problem with one non-convex constraint
Keyanpour, Mohammad, (2018)
- More ...
-
Duality gap estimation of linear equality constrained binary quadratic programming
Zheng, Xiaojin, (2010)
-
An efficient continuation method for quadratic assignment problems
Xia, Yong, (2010)
-
Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
Xia, Yong, (2012)
- More ...