Fetching the paper…
Reading the bibliography…
This paper considers the minimization of a general objective function $f(X)$ over the set of rectangular $n\times m$ matrices that have rank at most $r$.
D. C. Liu and J. Nocedal, “On the limited memory BFGS method for large scale optimization,” Math. Program
1989
Earlier work this paper cites.
SIAM, 2000
A. R. Conn, N. I. Gould, and P. L. Toint, Trust region methods · 2000
Earlier work this paper cites.
C. R. Johnson, K. Okubo, and R. Reams, “Uniqueness of matrix square roots and an application,” Linear Algebra and Its Applications
2001
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,” Mathematical Programming
2003
Earlier work this paper cites.
N. Srebro, T. Jaakkola, et al
2003
Earlier work this paper cites.
N. Srebro, J. Rennie, and T. S. Jaakkola, “Maximum-margin matrix factorization,” in Advances in Neural Information Processing Systems
2004
Earlier work this paper cites.
P. Biswas and Y. Ye, “Semidefinite programming for ad hoc wireless sensor network localization,” in Proceedings of the 3rd international symposium on Information processing in sensor networks
2004
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. Boyd, “Rank minimization and applications in system theory,” in American Control Conference
2004
Earlier work this paper cites.
S. Burer and R. D. Monteiro, “Local minima and convergence in low-rank semidefinite programming,” Mathematical Programming
2005
Earlier work this paper cites.
D. DeCoste, “Collaborative prediction using ensembles of maximum margin matrix factorizations,” in Proceedings of the 23rd International Conference on Machine Learning
2006
Earlier work this paper cites.
S. Aaronson, “The learnability of quantum states,” in Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics
2009
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review
2010
Earlier work this paper cites.
K. Mohan and M. Fazel, “Reweighted nuclear norm minimization with application to system identification,” in Proceedings of the 2010 American Control Conference
2010
Earlier work this paper cites.
P. Jain, R. Meka, and I. S. Dhillon, “Guaranteed rank minimization via singular value projection,” in Advances in Neural Information Processing Systems
2010
Earlier work this paper cites.
J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization
2010
Earlier work this paper cites.
G. Tang and A. Nehorai, “Lower bounds on the mean-squared error of low-rank matrix reconstruction,” IEEE Transactions on Signal Processing
2011
Cited alongside, same era.
E. J. Candès and Y. Plan, “Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,” IEEE Transactions on Information Theory
2011
Cited alongside, same era.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?,” Journal of the ACM (JACM)
2011
Cited alongside, same era.
N. Gillis and F. Glineur, “Low-rank matrix approximation with weights or missing data is NP-hard,” SIAM Journal on Matrix Analysis and Applications
2011
Cited alongside, same era.
S. T. Flammia, D. Gross, Y.-K. Liu, and J. Eisert, “Quantum tomography via compressed sensing: Error bounds, sample complexity and efficient estimators,” New Journal of Physics
S. A. Bhaskar and A. Javanmard, “1-bit matrix completion under exact low-rank constraint,” in 49th Annual Conference on Information Sciences and Systems (CISS)
2015
Later among the works it cites.
G. Liu and P. Li, “Low-rank matrix completion in the presence of high coherence,” IEEE Transactions on Signal Processing
2016
Later among the works it cites.
M. A. Davenport and J. Romberg, “An overview of low-rank matrix recovery from incomplete observations,” IEEE Journal of Selected Topics in Signal Processing
2016
Later among the works it cites.
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Z. Harchaoui, M. Douze, M. Paulin, M. Dudik, and J. Malick, “Large-scale image classification with trace-norm regularization,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
2012
Cited alongside, same era.
T. Cai and W.-X. Zhou, “A max-norm constrained minimization approach to 1-bit matrix completion.,” Journal of Machine Learning Research
2013
Cited alongside, same era.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing
2013
Cited alongside, same era.
2014
Cited alongside, same era.
M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters, “1-bit matrix completion,” Information and Inference
2014
Cited alongside, same era.
J. Salmon, Z. Harmany, C.-A. Deledalle, and R. Willett, “Poisson noise reduction with non-local PCA,” Journal of Mathematical Imaging and Vision
2014
Cited alongside, same era.
R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points—online stochastic gradient for tensor decomposition,” in Proceedings of The 28th Conference on Learning Theory
2015
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
CRC Press, 2016
T. Bouwmans, N. S. Aybat, and E.-h. Zahzah, Handbook of Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing · 2016
Later among the works it cites.
2016
Later among the works it cites.
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht, “Gradient descent converges to minimizers,” University of California, Berkeley
2016
Later among the works it cites.
L. Xu and M. Davenport, “Dynamic matrix recovery from incomplete observations under an exact low-rank constraint,” in Advances in Neural Information Processing Systems
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Closest in time.
Y. Li, Y. Sun, and Y. Chi, “Low-rank positive semidefinite matrix recovery from corrupted rank-one measurements,” IEEE Transactions on Signal Processing
2017
Closest in time.
2017
Closest in time.