A Low-rank augmented lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
- 29 April 2026
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- p. 1-57
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Air Force Office of Scientific Research (FA9550-22-1-0088)
- Office of Naval Research (N00014-23-1-2631)
This publication has 56 references indexed in Scilit:
- Scalable Low-Rank Semidefinite Programming for Certifiably Correct Machine Perception2021
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite ProgramsCommunications on Pure and Applied Mathematics, 2019
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex ProgrammingCommunications on Pure and Applied Mathematics, 2012
- Sparse Approximate Solutions to Semidefinite Programs2008
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 2004
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- A second-order bundle method to minimize the maximum eigenvalue functionMathematical Programming, 2000
- Design and Performance of Parallel and Distributed Approximation Algorithms for MaxcutJournal of Parallel and Distributed Computing, 1997
- Problems of distance geometry and convex properties of quadratic mapsDiscrete & Computational Geometry, 1995
- Rank-Reducibility of a Symmetric Matrix and Sampling Theory of Minimum Trace Factor AnalysisPsychometrika, 1982