Pages that link to "Item:Q2047215"
From MaRDI portal
The following pages link to On the Burer-Monteiro method for general semidefinite programs (Q2047215):
Displaying 10 items.
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- Scalable Semidefinite Programming (Q4999352) (← links)
- Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming (Q5043284) (← links)
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs (Q5114191) (← links)
- Solving graph equipartition SDPs on an algebraic variety (Q6120843) (← 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)
- A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
- Riemannian Langevin algorithm for solving semidefinite programs (Q6635727) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)