Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets

DOI10.1287/moor.26.3.519.10580zbMath1073.90580OpenAlexW2142899018MaRDI QIDQ2757680

Akiko Takeda, Kojima, Masakazu

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b55c1baf211e70f3e0158852cd03acb8356e1ad2

zbMATH Keywords

Complexity, nonconvex quadratic program, semidefinite programming, global optimization, SDP relaxation, convex relaxation, lift-and-project procedure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

On the finite convergence of successive SDP relaxation methods

This page was built for publication: Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets