Smoothed analysis of the low-rank approach for smooth semidefinite
programs

v1v2 (latest)

Smoothed analysis of the low-rank approach for smooth semidefinite programs

11 June 2018

ArXiv (abs)PDF HTML

Papers citing "Smoothed analysis of the low-rank approach for smooth semidefinite programs"

6 / 6 papers shown

Title
Lecture notes on non-convex algorithms for low-rank matrix recovery Irène Waldspurger 58 1 0 21 May 2021
Rank-One Measurements of Low-Rank PSD Matrices Have Small Feasible Sets T. Roddenberry Santiago Segarra Anastasios Kyrillidis 45 0 0 17 Dec 2020
Riemannian Langevin Algorithm for Solving Semidefinite Programs Mufan Li Murat A. Erdogdu 118 29 0 21 Oct 2020
Polynomial time guarantees for the Burer-Monteiro method Diego Cifuentes Ankur Moitra 162 37 0 03 Dec 2019
Efficiently escaping saddle points on manifolds Christopher Criscitiello Nicolas Boumal 90 63 0 10 Jun 2019
Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDPs Murat A. Erdogdu Asuman Ozdaglar P. Parrilo N. D. Vanli 75 33 0 12 Jul 2018