RTRMC: A Riemannian trust-region method for low-rank matrix completion

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Boumal, Nicolas ^a   Absil, P A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ITERATIVE METHODS;

FIRST ORDER; GRASSMANN MANIFOLD; LOW-RANK MATRIX COMPLETIONS; MATRIX; MATRIX COMPLETION; OPTIMIZATION FRAMEWORK; RANK CONSTRAINTS; SECOND ORDERS; TRUST-REGION METHODS; UNCONSTRAINED OPTIMIZATION PROBLEMS;

CONSTRAINED OPTIMIZATION;

EID: 85162495153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. P.-A. Absil, C. G. Baker, and K. A. Gallivan. Trust-region methods on Riemannian manifolds. Found. Comput. Math., 7(3):303-330, July 2007.
2. P.-A. Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ, 2008.
3. L. Balzano, R. Nowak, and B. Recht. Online identification and tracking of subspaces from highly incomplete information. In Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, pages 704-711. IEEE, 2010.
4. M. Brookes. The matrix reference manual. Imperial College London, 2005.
5. J.F. Cai, E.J. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. Arxiv preprint arXiv:0810.3286, 2008.
6. E.J. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6):717-772, 2009.
7. W. Dai, E. Kerman, and O. Milenkovic. A Geometric Approach to Low-Rank Matrix Completion. Arxiv preprint arXiv:1006.2086, 2010.
8. W. Dai, O. Milenkovic, and E. Kerman. Subspace evolution and transfer (SET) for low-rank matrix completion. Signal Processing, IEEE Transactions on, PP(99):1, 2011.
9. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133-151, 2001.
10. R.H. Keshavan and A. Montanari. Regularization for matrix completion. In Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, pages 1503-1507. IEEE, 2010.
11. R.H. Keshavan, A. Montanari, and S. Oh. Low-rank matrix completion with noisy observations: a quantitative comparison. In Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on, pages 1216-1222. IEEE, 2009.
12. R.H. Keshavan and S. Oh. OptSpace: A gradient descent algorithm on the Grassman manifold for matrix completion. Arxiv preprint arXiv:0910.5260 v2, 2009.
13. R.M. Larsen. PROPACK-Software for large and sparse SVD calculations. Available online. URL http://sun.stanford.edu/rmunk/PROPACK, 2005.
14. K. Lee and Y. Bresler. ADMiRA: Atomic decomposition for minimum rank approximation. Information Theory, IEEE Transactions on, 56(9):4402-4416, 2010.
15. G. Meyer, S. Bonnabel, and R. Sepulchre. Linear regression under fixed-rank constraints: a Riemannian approach. In 28th International Conference on Machine Learning. ICML, 2011.
16. L.N. Trefethen and D. Bau. Numerical linear algebra. Society for Industrial Mathematics, 1997.
17. B. Vandereycken. Low-rank matrix completion by riemannian optimization. Technical report, ANCHP-MATHICSE, Mathematics Section, École Polytechnique Fédérale de Lausanne, 2011.
18. Z. Wen, W. Yin, and Y. Zhang. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Technical report, Rice University, 2010. CAAM Technical Report TR10-07.