On the Burer-Monteiro method for general semidefinite programs

DOI10.1007/S11590-021-01705-4zbMath1475.90053arXiv1904.07147OpenAlexW3127944417MaRDI QIDQ2047215

Diego Cifuentes

Publication date: 19 August 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.07147

zbMATH Keywords

semidefinite programmingnonconvex optimizationlow rank factorizationspurious local minimaBurer-Monteiro method

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (5)

Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming ⋮ Solving graph equipartition SDPs on an algebraic variety ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Low-Rank Univariate Sum of Squares Has No Spurious Local Minima ⋮ Scalable Semidefinite Programming

Uses Software

• SDPLR

Cites Work

• Unnamed Item
• Unnamed Item
• Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
• Problems of distance geometry and convex properties of quadratic maps
• Critical points of matrix least squares distance functions
• Second-order cone programming
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A semidefinite programming method for integer convex quadratic minimization
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• On the approximate augmented Lagrangian for nonlinear symmetric cone programming
• Local minima and convergence in low-rank semidefinite programming
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• A stabilized SQP method: global convergence
• Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
• Nonlinear Programming
• A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING

This page was built for publication: On the Burer-Monteiro method for general semidefinite programs