Low-Rank Matrix Completion
暂无分享,去创建一个
[1] G. Watson. Characterization of the subdifferential of some matrix norms , 1992 .
[2] J. Shewchuk. An Introduction to the Conjugate Gradient Method Without the Agonizing Pain , 1994 .
[3] Kim-Chuan Toh,et al. SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .
[4] Alan Edelman,et al. The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..
[5] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[6] P. Erd6s. ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .
[7] Matthew Brand,et al. Incremental Singular Value Decomposition of Uncertain Data with Missing Values , 2002, ECCV.
[8] Adrian Lewis,et al. The mathematics of eigenvalue optimization , 2003, Math. Program..
[9] Takeo Kanade,et al. Shape and motion from image streams under orthography: a factorization method , 1992, International Journal of Computer Vision.
[10] M. Brand,et al. Fast low-rank modifications of the thin singular value decomposition , 2006 .
[11] James Bennett,et al. The Netflix Prize , 2007 .
[12] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[13] Andrea Montanari,et al. Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.
[14] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[15] Robert D. Nowak,et al. Online identification and tracking of subspaces from highly incomplete information , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[16] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[17] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[18] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[19] Yin Zhang,et al. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm , 2012, Mathematical Programming Computation.
[20] Yousef Saad,et al. Scaled Gradients on Grassmann Manifolds for Matrix Completion , 2012, NIPS.
[21] S. Osher,et al. Fast Singular Value Thresholding without Singular Value Decomposition , 2013 .
[22] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[23] Zhi-Quan Luo,et al. Guaranteed Matrix Completion via Non-Convex Factorization , 2014, IEEE Transactions on Information Theory.
[24] Yudong Chen,et al. Incoherence-Optimal Matrix Completion , 2013, IEEE Transactions on Information Theory.
[25] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.