Fetching the paper…
Reading the bibliography…
The task of recovering a low-rank matrix from its noisy linear measurements plays a central role in computational science.
The quasigradient method for the solving of the nonlinear programming problems
E.A. Nurminskii · 1973
Earlier work this paper cites.
On convergence rates of subgradient optimization methods
J.L. Goffin · 1977
Earlier work this paper cites.
On paraconvex multifunctions
S. Rolewicz · 1979
Earlier work this paper cites.
A model algorithm for composite nondifferentiable optimization problems
R. Fletcher · 1980
Earlier work this paper cites.
Favorable classes of Lipschitz-continuous functions in subgradient optimization
R.T. Rockafellar · 1982
Earlier work this paper cites.
Descent methods for composite nondifferentiable optimization problems
J.V. Burke · 1985
Earlier work this paper cites.
A Gauss-Newton method for convex composite optimization
J.V. Burke and M.C. Ferris · 1995
Earlier work this paper cites.
Prox-regular functions in variational analysis
R.A. Poliquin and R.T. Rockafellar · 1996
Earlier work this paper cites.
Variational Analysis
R.T. Rockafellar and R.J-B. Wets · 1998
Earlier work this paper cites.
Singularities of semiconcave functions in Banach spaces
P. Albano and P. Cannarsa · 1999
Earlier work this paper cites.
Convex analysis and nonlinear optimization
J.M. Borwein and A.S. Lewis · 2000
Earlier work this paper cites.
Matrix Rank Minimization with Applications
M. Fazel · 2002
Earlier work this paper cites.
Concentration around the mean for maxima of empirical processes
T. Klein and E. Rio · 2005
Earlier work this paper cites.
Variational Analysis and Generalized Differentiation I: Basic Theory
B. S. Mordukhovich · 2006
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P.A. Parrilo · 2010
Earlier work this paper cites.
Robust principal component analysis?
E.J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
E.J. Candes and Y. Plan · 2011
Earlier work this paper cites.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P.A. Parrilo, and A.S. Willsky · 2011
Earlier work this paper cites.
A unified framework for high-dimensional analysis of M M -estimators with decomposable regularizers
S.N. Negahban, P. Ravikumar, M.J. Wainwright, and B. Yu · 2012
Earlier work this paper cites.
Concentration inequalities: A nonasymptotic theory of independence
S. Boucheron, G. Lugosi, and P. Massart · 2013
Cited alongside, same era.
Phase retrieval via matrix completion
E.J. Candès, Y.C. Eldar, T. Strohmer, and V. Voroninski · 2013
Cited alongside, same era.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
E.J. Candes, T. Strohmer, and V. Voroninski · 2013
Cited alongside, same era.
Blind deconvolution using convex programming
A. Ahmed, B. Recht, and J. Romberg · 2014
Cited alongside, same era.
Phase retrieval: stability and recovery guarantees
Y.C. Eldar and S. Mendelson · 2014
Cited alongside, same era.
A remark on the diameter of random sections of convex bodies
S. Mendelson · 2014
Cited alongside, same era.
Guaranteed matrix completion via non-convex factorization
R. Sun and Z.-Q. Luo · 2016
Later among the works it cites.
Low-rank solutions of linear matrix equations via Procrustes flow
S. Tu, R. Boczar, M. Simchowitz, M. Soltanolkotabi, and B. Recht · 2016
Later among the works it cites.
Fast algorithms for robust pca via gradient descent
X. Yi, D. Park, Y. Chen, and C. Caramanis · 2016
Later among the works it cites.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Y. Chen and E.J. Candès · 2017
Later among the works it cites.
The nonsmooth landscape of phase retrieval
D. Davis, D. Drusvyatskiy, and C. Paquette · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Block splitting for distributed optimization
N. Parikh and S. Boyd · 2014
Cited alongside, same era.
Small ball probabilities for linear images of high-dimensional distributions
M. Rudelson and R. Vershynin · 2014
Cited alongside, same era.
ROP: matrix recovery via rank-one projections
T.T. Cai and A. Zhang · 2015
Cited alongside, same era.
Phase retrieval via Wirtinger flow: theory and algorithms
E.J. Candès, X. Li, and M. Soltanolkotabi · 2015
Cited alongside, same era.
Exact and stable covariance estimation from quadratic sampling via convex programming
Y. Chen, Y. Chi, and A.J. Goldsmith · 2015
Cited alongside, same era.
Y. Chen and M.J. Wainwright · 2015
Cited alongside, same era.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
R. Ge, C. Jin, and Y. Zheng · 2017
Later among the works it cites.
Nonconvex optimization meets low-rank matrix factorization: An overview
Y. Chi, Y.M. Lu, and Y. Chen · 2018
Later among the works it cites.
Subgradient methods for sharp weakly convex functions
D. Davis, D. Drusvyatskiy, K.J. MacPhee, and C. Paquette · 2018
Later among the works it cites.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy and A.S. Lewis · 2018
Later among the works it cites.
Efficiency of minimizing compositions of convex functions and smooth maps
D. Drusvyatskiy and C. Paquette · 2018
Later among the works it cites.
Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
J.C. Duchi and F. Ruan · 2018
Later among the works it cites.
Stochastic methods for composite and weakly convex optimization problems
J.C. Duchi and F. Ruan · 2018
Later among the works it cites.
Phasemax: Convex phase retrieval via basis pursuit
T. Goldstein and C. Studer · 2018
Later among the works it cites.
Nonconvex robust low-rank matrix recovery
X. Li, Z. Zhu, A.M.-C. So, and R. Vidal · 2018
Later among the works it cites.
Nonconvex matrix factorization from rank-one measurements
Y. Li, C. Ma, Y. Chen, and Y. Chi · 2018
Later among the works it cites.
Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval and matrix completion
C. Ma, K. Wang, Y. Chi, and Y. Chen · 2018
Later among the works it cites.
High-Dimensional Probability: An Introduction with Applications in Data Science
Roman Vershynin · 2018
Later among the works it cites.
Composite optimization for robust blind deconvolution
V. Charisopoulos, D. Davis, M. Díaz, and D. Drusvyatskiy · 2019
Closest in time.
Stochastic model-based minimization of weakly convex functions
D. Davis and D. Drusvyatskiy · 2019
Closest in time.