Fetching the paper…
Reading the bibliography…
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods, but scalability can be an issue.
Convex analysis
R.T. Rockafellar · 1970
Earlier work this paper cites.
Nonlinear optimization: complexity issues
S.A. Vavasis · 1991
Earlier work this paper cites.
Problems of distance geometry and convex properties of quadratic maps
A.I. Barvinok · 1995
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M.X. Goemans and D.P. Williamson · 1995
Earlier work this paper cites.
An interior-point method for semidefinite programming
C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz · 1996
Earlier work this paper cites.
On the facial structure of the set of correlation matrices
M. Laurent and S. Poljak · 1996
Earlier work this paper cites.
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
G. Pataki · 1998
Earlier work this paper cites.
SDPT3–a MATLAB software package for semidefinite programming
K.C. Toh, M.J. Todd, and R.H. Tütüncü · 1999
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R.D.C. Monteiro · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course , volume 87 of Applied optimization
Y. Nesterov · 2004
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R.D.C. Monteiro · 2005
Earlier work this paper cites.
Approximating the cut-norm via Grothendieck’s inequality
N. Alon and A. Naor · 2006
Earlier work this paper cites.
Nonlinear optimization
A.P. Ruszczyński · 2006
Cited alongside, same era.
Trust-region methods on Riemannian manifolds
P.-A. Absil, C. G. Baker, and K. A. Gallivan · 2007
Cited alongside, same era.
Optimization Algorithms on Matrix Manifolds
P.-A. Absil, R. Mahony, and R. Sepulchre · 2008
Cited alongside, same era.
Constant-rank condition and second-order constraint qualification
R. Andreani, C. E. Echagüe, and M. L. Schuverdt · 2010
Cited alongside, same era.
Low-rank optimization on the cone of positive semidefinite matrices
M. Journée, F. Bach, P.-A. Absil, and R. Sepulchre · 2010
Cited alongside, same era.
Angular synchronization by eigenvectors and semidefinite programming
A. Singer · 2010
Cited alongside, same era.
Manopt, a Matlab toolbox for optimization on manifolds
N. Boumal, B. Mishra, P.-A. Absil, and R. Sepulchre · 2014
Later among the works it cites.
Optimality conditions for the nonlinear programming problems on Riemannian manifolds
W.H. Yang, L.-H. Zhang, and R. Song · 2014
Later among the works it cites.
N. Boumal · 2015
Later among the works it cites.
Phase recovery, MaxCut and complex semidefinite programming
I. Waldspurger, A. d’Aspremont, and S. Mallat · 2015
Later among the works it cites.
Exact recovery in the stochastic block model
E. Abbe, A.S. Bandeira, and G. Hall · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Two proposals for robust PCA using semidefinite programming
M. McCoy and J.A. Tropp · 2011
Cited alongside, same era.
CVX: Matlab software for disciplined convex programming
CVX · 2012
Cited alongside, same era.
Introduction to Smooth Manifolds , volume 218 of Graduate Texts in Mathematics
J.M. Lee · 2012
Cited alongside, same era.
Exact and stable recovery of rotations for robust synchronization
L. Wang and A. Singer · 2013
Cited alongside, same era.
A feasible method for optimization with orthogonality constraints
Z. Wen and W. Yin · 2013
Cited alongside, same era.
Approximating the little Grothendieck problem over the orthogonal and unitary groups
A.S. Bandeira, C. Kennedy, and A. Singer
Cited in the paper.
On the low-rank approach for semidefinite programs arising in synchronization and community detection
A.S. Bandeira, N. Boumal, and V. Voroninski · 2016
Closest in time.
Global rates of convergence for nonconvex optimization on manifolds
N. Boumal, P.-A. Absil, and C. Cartis · 2016
Closest in time.
Matrix completion has no spurious local minimum
R. Ge, J.D. Lee, and T. Ma · 2016
Closest in time.
Phase transitions in semidefinite relaxations
A. Javanmard, A. Montanari, and F. Ricci-Tersenghi · 2016
Closest in time.
Biconvex relaxation for semidefinite programming in computer vision
S. Shah, A. Kumar, D. Jacobs, C. Studer, and T. Goldstein · 2016
Closest in time.
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
A.S. Bandeira, N. Boumal, and A. Singer · 2017
Closest in time.