On the finite convergence of successive SDP relaxation methods

DOI10.1016/S0377-2217(02)00298-9zbMath1058.90048OpenAlexW2109966743MaRDI QIDQ1848385

Kojima, Masakazu, Tunçel, Levent

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00298-9

zbMATH Keywords

Global optimizationComplexity theoryLift-and-project procedureNonconvex quadratic programSemidefinite programming relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items

Generalized S-lemma and strong duality in nonconvex quadratic programming, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Error bounds and finite termination for constrained optimization problems

Cites Work

• Unnamed Item
• A new reformulation-linearization technique for bilinear programming problems
• Semidefinite programming relaxation for nonconvex quadratic programs
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
• The directions of the line segments and of the r ‐dimensional balls on the boundary of a convex body in Euclidean space
• Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.