Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems

DOI10.1007/s10898-008-9328-4zbMath1180.90227OpenAlexW2002930568MaRDI QIDQ839323

Laura Palagi, Luigi Grippo, Veronica Piccialli

Publication date: 2 September 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-008-9328-4

zbMATH Keywords

semidefinite programmingoptimality conditionslow-rank factorization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Finding graph embeddings by incremental low-rank semidefinite programming, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, A strengthened Barvinok-Pataki bound on SDP rank, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem, Computational Approaches to Max-Cut

Uses Software

• SDPLR

Cites Work

• Unnamed Item
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Conditions for global optimality. II
• Problems of distance geometry and convex properties of quadratic maps
• First- and second-order methods for semidefinite programming
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Local minima and convergence in low-rank semidefinite programming
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming