Robust principal component analysis?
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Exact Matrix Completion via Convex Optimization
Compressive sampling
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
A Singular Value Thresholding Algorithm for Matrix Completion
IEEE Transactions on Information Theory
Journal of the ACM
SIAM Journal on Optimization
Foundations of Computational Mathematics
Terence Tao
Zuowei Shen
Jian-Feng Cai
Benjamin Recht
John Wright
Yi Ma
Revealed Preference at Scale
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Online Matrix Completion for Signed Link Prediction
Beyond worst-case analysis in private singular vector computation
A Mixed-Norm Laplacian Regularized Low-Rank Representation Method for Tumor Samples Clustering
Subspace Clustering Using Log-determinant Rank Approximation