L. Balzano, R. Nowak, and B. Recht, Online identification and tracking of subspaces from highly incomplete information, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.704-711, 2010.
DOI : 10.1109/ALLERTON.2010.5706976

M. Brand, Fast low-rank modifications of the thin singular value decomposition. Linear algebra and its applications, pp.20-30, 2006.

J. Cai, E. J. Candès, and Z. Shen, A Singular Value Thresholding Algorithm for Matrix Completion, SIAM Journal on Optimization, vol.20, issue.4, pp.1956-1982, 2010.
DOI : 10.1137/080738970

E. Candès and T. Tao, The power of convex relaxation: Near-optimal matrix completion. Information Theory, IEEE Transactions on, vol.56, issue.5, pp.2053-2080, 2010.

E. J. Candes and Y. Plan, Matrix Completion With Noise, Proceedings of the IEEE, pp.925-936, 2010.
DOI : 10.1109/JPROC.2009.2035722
URL : http://arxiv.org/abs/0903.3131

E. J. Candès and B. Recht, Exact Matrix Completion via Convex Optimization, Foundations of Computational Mathematics, vol.170, issue.1, pp.717-772, 2009.
DOI : 10.1007/s10208-009-9045-5

C. Eckart and G. Young, The approximation of one matrix by another of lower rank, Psychometrika, vol.1, issue.3, pp.211-218, 1936.
DOI : 10.1007/BF02288367

N. Halko, P. Martinsson, and J. A. Tropp, Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions, SIAM Review, vol.53, issue.2, pp.217-288, 2011.
DOI : 10.1137/090771806
URL : http://arxiv.org/abs/0909.4061

M. Jaggi and M. Sulovsk, Sulovsk`y. A simple algorithm for nuclear norm regularized problems, Proceedings of the International Conference on Machine Learning (ICML), pp.471-478, 2010.

S. Ji and J. Ye, An accelerated gradient method for trace norm minimization, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.457-464, 2009.
DOI : 10.1145/1553374.1553434
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.1201

R. H. Keshavan, A. Montanari, and S. Oh, Matrix completion from a few entries. Information Theory, IEEE Transactions on, vol.56, issue.6, pp.2980-2998, 2010.

R. M. Larsen, Lanczos Bidiagonalization With Partial Reorthogonalization, DAIMI Report Series, vol.27, issue.537, 1998.
DOI : 10.7146/dpb.v27i537.7070
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.9527

K. Lee and Y. Bresler, Admira: Atomic decomposition for minimum rank approximation. Information Theory, IEEE Transactions on, vol.56, issue.9, pp.4402-4416, 2010.
DOI : 10.1109/tit.2010.2054251
URL : http://arxiv.org/abs/0905.0044

Y. Liu, D. Sun, and K. Toh, An implementable proximal point algorithmic framework for nuclear norm minimization, Mathematical Programming, pp.399-436, 2012.
DOI : 10.1007/s10107-010-0437-8

S. Ma, D. Goldfarb, and L. Chen, Fixed point and Bregman iterative methods for matrix rank minimization, Mathematical Programming, pp.321-353, 2011.
DOI : 10.1007/s10107-009-0306-5
URL : http://arxiv.org/abs/0905.1643

R. Mazumder, T. Hastie, and R. Tibshirani, Spectral regularization algorithms for learning large incomplete matrices, The Journal of Machine Learning Research, vol.11, pp.2287-2322, 2010.

B. Recht, C. Ré, and S. Wright, Parallel stochastic gradient algorithms for large-scale matrix completion. Optimization Online, 2011.

E. Richard, N. Baskiotis, T. Evgeniou, and N. Vayatis, Link discovery using graph feature tracking, Proceedings of Neural Information Processing Systems (NIPS), 2010.
URL : https://hal.archives-ouvertes.fr/hal-01289169

A. Schein, A. Popescul, L. Ungar, and D. Pennock, Methods and metrics for cold-start recommendations, Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '02, pp.253-260, 2002.
DOI : 10.1145/564376.564421
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6042

B. Schölkopf, A. J. Smola, and K. Müller, Nonlinear Component Analysis as a Kernel Eigenvalue Problem, Neural Computation, vol.20, issue.5, pp.1299-1319, 1998.
DOI : 10.1007/BF02281970

S. Shalev-shwartz, A. Gonen, and O. Shamir, Large-scale convex minimization with a lowrank constraint, 2011.

N. Srebro, J. D. Rennie, and T. Jaakkola, Maximum-margin matrix factorization Advances in neural information processing systems, pp.1329-1336, 2005.

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society. Series B (Methodological), pp.267-288, 1996.
DOI : 10.1111/j.1467-9868.2011.00771.x

K. Toh and S. Yun, An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems, Pacific Journal of Optimization, vol.6, pp.615-64015, 2010.

J. Yun and S. Choi, Nyström approximations for scalable face recognition: A comparative study, Neural Information Processing, pp.325-334, 2011.

H. Zha and H. Simon, On Updating Problems in Latent Semantic Indexing, SIAM Journal on Scientific Computing, vol.21, issue.2, p.782, 1999.
DOI : 10.1137/S1064827597329266

H. Zhao, J. Han, N. Wang, C. Xu, and Z. Zhang, A fast spectral relaxation approach to matrix completion via kronecker products, Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011.