The Power of Convex Relaxation: Near-Optimal Matrix Completion (2009)

Cached

Download Links

by Emmanuel J. Candès , Terence Tao
Citations:60 - 1 self

Active Bibliography

The Power of Convex Relaxation: Near-Optimal Matrix Completion – Emmanuel J. C, Terence Tao - 2009
Matrix Completion with Noise – Emmanuel J. C, Yaniv Plan - 2009
23 Matrix Completion with Noise – Emmanuel J. Candès, Yaniv Plan
A Singular value . . . – Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen - 2008
A Singular Value Thresholding Algorithm for Matrix Completion – Ès Zuowei Shen - 2008
147 Exact Matrix Completion via Convex Optimization – Emmanuel J. Candès, Benjamin Recht - 2008
Academy of Sciences, China. – Zhouchen Lin, Minming Chen, Leqin Wu, Yi Ma, Zhouchen Lin, Minming Chen, Leqin Wu, Yi Ma
SUFFICIENT CONDITIONS FOR LOW-RANK MATRIX RECOVERY, TRANSLATED FROM SPARSE SIGNAL RECOVERY – Lingchen Kong, Levent Tunçel, Naihua Xiu
Gaussian processes. – Benjamin Recht, Weiyu Xu Babak, B. Recht, W. Xu, B. Hassibi
Robust Principal Component Analysis? – Emmanuel J. C, Xiaodong Li, Yi Ma, John Wright - 2009
5 Null Space Conditions and Thresholds for Rank Minimization – Benjamin Recht, Weiyu Xu, Babak Hassibi - 2009
2 Approximation Accuracy, Gradient Methods, and Error Bound for Structured Convex Optimization – Paul Tseng - 2009
4 Tensor Completion for Estimating Missing Values in Visual Data – Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping Ye
24 An Accelerated Gradient Method for Trace Norm Minimization – Shuiwang Ji, Jieping Ye
small number of – Emmanuel J. C, Yaniv Plan - 910
100 Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization – Benjamin Recht, Maryam Fazel, Pablo A. Parrilo - 2007
An – Kim-chuan Toh Sangwoon Yun
29 Ranksparsity incoherence for matrix decomposition – Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo, S. Willsky, Alan - 2009
1 An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors – Yangyang Xu, Wotao Yin, Zaiwen Wen, Yin Zhang