Fetching the paper…
Reading the bibliography…
We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective.
A practical algorithm for the determination of phase from image and diffraction plane pictures
R. Gerchberg · 1972
Earlier work this paper cites.
A trace inequality of John von Neumann
L. Mirsky · 1975
Earlier work this paper cites.
Phase retrieval and image reconstruction for astronomy
C. Fienup and J. Dainty · 1987
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R. Monteiro · 2003
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
S. Burer and R. Monteiro · 2005
Earlier work this paper cites.
The learnability of quantum states
S. Aaronson · 2007
Earlier work this paper cites.
Sparse approximate solutions to semidefinite programs
E. Hazan · 2008
Earlier work this paper cites.
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
A. Agarwal, S. Negahban, and M. Wainwright · 2010
Earlier work this paper cites.
Online identification and tracking of subspaces from highly incomplete information
L. Balzano, R. Nowak, and B. Recht · 2010
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
J. Cai, E. Candès, and Z. Shen · 2010
Earlier work this paper cites.
Quantum state tomography via compressed sensing
D. Gross, Y.-K. Liu, S. Flammia, S. Becker, and J. Eisert · 2010
Earlier work this paper cites.
Guaranteed rank minimization via singular value projection
P. Jain, R. Meka, and I. Dhillon · 2010
Earlier work this paper cites.
ADMiRA: Atomic decomposition for minimum rank approximation
K. Lee and Y. Bresler · 2010
Earlier work this paper cites.
The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices
Z. Lin, M. Chen, and Y. Ma · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. Parrilo · 2010
Earlier work this paper cites.
NESTA: A fast and accurate first-order method for sparse recovery
S. Becker, J. Bobin, and E. Candès · 2011
Earlier work this paper cites.
Templates for convex cone problems with applications to sparse signal recovery
S. Becker, E. Candès, and M. Grant · 2011
Earlier work this paper cites.
RTRMC: A Riemannian trust-region method for low-rank matrix completion
N. Boumal and P.-A. Absil · 2011
Cited alongside, same era.
Universal low-rank matrix recovery from Pauli measurements
Y.-K. Liu · 2011
Cited alongside, same era.
Quantum tomography via compressed sensing: Error bounds, sample complexity and efficient estimators
S. Flammia, D. Gross, Y.-K. Liu, and J. Eisert · 2012
Cited alongside, same era.
A hybrid algorithm for convex semidefinite optimization
S. Laue · 2012
Cited alongside, same era.
CPRL – an extension of compressive sensing to the phase retrieval problem
H. Ohlsson, A. Yang, R. Dong, and S. Sastry · 2012
Cited alongside, same era.
CPRL – an extension of compressive sensing to the phase retrieval problem
H Ohlsson, A. Yang, R. Dong, and S. Sastry · 2012
Theory of convex optimization for machine learning
S. Bubeck · 2014
Later among the works it cites.
Coherent matrix completion
Y. Chen, S. Bhojanapalli, S. Sanghavi, and R. Ward · 2014
Later among the works it cites.
Fast matrix completion without the condition number
M. Hardt and M. Wootters · 2014
Later among the works it cites.
Matrix recipes for hard thresholding methods
A. Kyrillidis and V. Cevher · 2014
Later among the works it cites.
GESPAR: Efficient phase retrieval of sparse signals
Y. Shechtman, A. Beck, and Y. Eldar · 2014
Later among the works it cites.
Phase retrieval via matrix completion
E. Candes, Y. Eldar, T. Strohmer, and V. Voroninski · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Z. Wen, W. Yin, and Y. Zhang · 2012
Cited alongside, same era.
Randomized low-memory singular value projection
S. Becker, V. Cevher, and A. Kyrillidis · 2013
Cited alongside, same era.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
E. Candes, T. Strohmer, and V. Voroninski · 2013
Cited alongside, same era.
Phase retrieval for imaging problems
F. Fogel, I. Waldspurger, and A. d’Aspremont · 2013
Cited alongside, same era.
Sparse phase retrieval: Convex algorithms and limitations
K. Jaganathan, S. Oymak, and B. Hassibi · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Cited alongside, same era.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. Candes, X. Li, and M. Soltanolkotabi · 2015
Later among the works it cites.
Y. Chen and M. Wainwright · 2015
Later among the works it cites.
Quantum tomography protocols with positivity are compressed sensing protocols
A. Kalev, R. Kosut, and I. Deutsch · 2015
Later among the works it cites.
Compressive phase retrieval via generalized approximate message passing
P. Schniter and S. Rangan · 2015
Later among the works it cites.
Low-rank solutions of linear matrix equations via Procrustes flow
S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht · 2015
Later among the works it cites.
A universal primal-dual convex optimization framework
A. Yurtsever, Q. Tran-Dinh, and V. Cevher · 2015
Later among the works it cites.
Global convergence of a grassmannian gradient descent algorithm for subspace estimation
D. Zhang and L. Balzano · 2015
Later among the works it cites.
A nonconvex optimization framework for low rank matrix estimation
T. Zhao, Z. Wang, and H. Liu · 2015
Later among the works it cites.
A convergent gradient descent algorithm for rank minimization and SDP from random linear measurements
Q. Zheng and J. Lafferty · 2015
Later among the works it cites.
Dropping convexity for faster semi-definite optimization
S. Bhojanapalli, A. Kyrillidis, and S. Sanghavi · 2016
Closest in time.