Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
From MaRDI portal
Publication:5926332
DOI10.1007/s101070000182zbMath1060.90058MaRDI QIDQ5926332
Kojima, Masakazu, Tunçel, Levent
Publication date: 2 July 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global optimizationsemidefinite programminginterior-point methodlinear matrix inequalitynonconvex quadratic optimization problemSDP relaxationsemi-infinite LP relaxation
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Interior-point methods (90C51) Semi-infinite programming (90C34)
Related Items (5)
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ Global optimization of rational functions: a semidefinite programming approach ⋮ Lagrangian decomposition of block-separable mixed-integer all-quadratic programs ⋮ On the finite convergence of successive SDP relaxation methods ⋮ On the Slater condition for the SDP relaxations of nonconvex sets
This page was built for publication: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
