The Power of Convex Relaxation: Near-Optimal Matrix Completion
Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization