Stable Principal Component Pursuit
暂无分享,去创建一个
Xiaodong Li | Zihan Zhou | Emmanuel J. Candès | John Wright | Yi Ma | Zihan Zhou | Yi Ma | E. Candès | Xiaodong Li | John Wright
[1] C. Eckart,et al. The approximation of one matrix by another of lower rank , 1936 .
[2] G. Stewart. Perturbation theory for the singular value decomposition , 1990 .
[3] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[4] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[5] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[6] Michael Elad,et al. Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.
[7] Martin J. Wainwright,et al. A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers , 2009, NIPS.
[8] Heng Tao Shen,et al. Principal Component Analysis , 2009, Encyclopedia of Biometrics.
[9] Arvind Ganesh,et al. Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix , 2009 .
[10] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[11] Emmanuel J. Candès,et al. Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements , 2010, ArXiv.
[12] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[13] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[14] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..