On the Simplicity and Conditioning of Low Rank Semidefinite Programs
From MaRDI portal
Publication:5162653
DOI10.1137/20M1346262zbMath1479.90154arXiv2002.10673OpenAlexW3210790457MaRDI QIDQ5162653
Publication date: 5 November 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.10673
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Numerical methods based on necessary conditions (49M05)
Related Items
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, A strict complementarity approach to error bound and sensitivity of solution of conic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on convex optimization
- Problems of distance geometry and convex properties of quadratic maps
- Complementarity and nondegeneracy in semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Conditioning of semidefinite programs
- A unified approach to error bounds for structured convex optimization problems
- Random Laplacian matrices and convex relaxations
- Faster subgradient methods for functions with Hölderian growth
- Phase recovery, MaxCut and complex semidefinite programming
- Exact matrix completion via convex optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Generic Minimizing Behavior in Semialgebraic Optimization
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Incoherence-Optimal Matrix Completion
- Array imaging using intensity-only measurements
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Strongly Regular Generalized Equations
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Error Bounds for Linear Matrix Inequalities
- On the Convergence of the Central Path in Semidefinite Optimization
- Rank Optimality for the Burer--Monteiro Factorization
- Why Are Big Data Matrices Approximately Low Rank?
- Global rates of convergence for nonconvex optimization on manifolds
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- Generic nondegeneracy in convex optimization
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Simpler Approach to Matrix Completion
- Learning Theory
- Constraint Nondegeneracy in Variational Analysis
