Fast Algorithms for Robust PCA via Gradient Descent
The Power of Convex Relaxation: Near-Optimal Matrix Completion