Fetching the paper…
Reading the bibliography…
Nonconvex matrix recovery is known to contain no spurious local minima under a restricted isometry property (RIP) with a sufficiently small RIP constant $\delta$.
Rank revealing qr factorizations
Tony F Chan · 1987
Earlier work this paper cites.
Some np-complete problems in quadratic and nonlinear programming
Katta G Murty and Santosh N Kabadi · 1987
Earlier work this paper cites.
Matrix computations
Gene H Golub and Charles F Van Loan · 1996
Earlier work this paper cites.
The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm
Erling D Andersen and Knud D Andersen · 2000
Earlier work this paper cites.
Trust region methods , volume 1
Andrew R Conn, Nicholas IM Gould, and Ph L Toint · 2000
Earlier work this paper cites.
Yalmip: A toolbox for modeling and optimization in matlab
Johan Lofberg · 2004
Earlier work this paper cites.
Fast maximum margin matrix factorization for collaborative prediction
Jasson DM Rennie and Nathan Srebro · 2005
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Yurii Nesterov and Boris T Polyak · 2006
Earlier work this paper cites.
Uncovering shared structures in multiclass classification
Yonatan Amit, Michael Fink, Nathan Srebro, and Shimon Ullman · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J Candès and Terence Tao · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo · 2010
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Emmanuel J Candes and Yaniv Plan · 2011
Earlier work this paper cites.
Complexity bounds for second-order optimality in unconstrained optimization
Coralia Cartis, Nicholas IM Gould, and Ph L Toint · 2012
Earlier work this paper cites.
Sharp RIP bound for sparse signal and low-rank matrix recovery
T Tony Cai and Anru Zhang · 2013
Cited alongside, same era.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
Emmanuel J Candes, Thomas Strohmer, and Vladislav Voroninski · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Cited alongside, same era.
Phase retrieval using alternating minimization
Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi · 2013
Cited alongside, same era.
The bounds of restricted isometry constants for low rank matrices recovery
HuiMin Wang and Song Li · 2013
Cited alongside, same era.
The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing
Phase retrieval meets statistical learning theory: A flexible convex relaxation
Sohail Bahmani and Justin Romberg · 2017
Later among the works it cites.
Gradient descent can take exponential time to escape saddle points
Simon S Du, Chi Jin, Jason D Lee, Michael I Jordan, Aarti Singh, and Barnabas Poczos · 2017
Later among the works it cites.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
Rong Ge, Chi Jin, and Yi Zheng · 2017
Later among the works it cites.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Later among the works it cites.
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
Dohyung Park, Anastasios Kyrillidis, Constantine Carmanis, and Sujay Sanghavi · 2017
Later among the works it cites.
The local convexity of solving systems of quadratic equations
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Andreas M Tillmann and Marc E Pfetsch · 2014
Cited alongside, same era.
Phase retrieval via wirtinger flow: Theory and algorithms
Emmanuel J Candes, Xiaodong Li, and Mahdi Soltanolkotabi · 2015
Cited alongside, same era.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Yuxin Chen and Emmanuel Candes · 2015
Cited alongside, same era.
Escaping from saddle points–online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Cited alongside, same era.
A nonconvex optimization framework for low rank matrix estimation
Tuo Zhao, Zhaoran Wang, and Han Liu · 2015
Cited alongside, same era.
A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements
Qinqing Zheng and John Lafferty · 2015
Cited alongside, same era.
Matrix completion has no spurious local minimum
Rong Ge, Jason D Lee, and Tengyu Ma · 2016
Cited alongside, same era.
Sujay Sanghavi, Rachel Ward, and Chris D White · 2017
Later among the works it cites.
Global rates of convergence for nonconvex optimization on manifolds
Nicolas Boumal, P-A Absil, and Coralia Cartis · 2018
Later among the works it cites.
Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
Pengwen Chen, Albert Fannjiang, and Gi-Ren Liu · 2018
Later among the works it cites.
Phasemax: Convex phase retrieval via basis pursuit
Tom Goldstein and Christoph Studer · 2018
Later among the works it cites.
Fundamental limits of weak recovery with applications to phase retrieval
Marco Mondelli and Andrea Montanari · 2018
Later among the works it cites.
Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, and Sujay Sanghavi · 2018
Later among the works it cites.
Solving systems of random quadratic equations via truncated amplitude flow
Gang Wang, Georgios B Giannakis, and Yonina C Eldar · 2018
Later among the works it cites.
Global optimality in low-rank matrix optimization
Zhihui Zhu, Qiuwei Li, Gongguo Tang, and Michael B Wakin · 2018
Later among the works it cites.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2078
Closest in time.