Pages that link to "Item:Q4971016"
From MaRDI portal
The following pages link to Rank Optimality for the Burer--Monteiro Factorization (Q4971016):
Displaying 14 items.
- Scalable Semidefinite Programming (Q4999352) (← links)
- Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization (Q6136653) (← links)
- Low-Rank Univariate Sum of Squares Has No Spurious Local Minima (Q6176423) (← links)
- Linear Programming on the Stiefel Manifold (Q6202765) (← links)
- Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs (Q6490317) (← links)
- Global minimization of polynomial integral functionals (Q6573176) (← links)
- Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
- Riemannian Langevin algorithm for solving semidefinite programs (Q6635727) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)