Robust PCA

We discover that once a solution to one of the models is obtained, we can obtain the solutions to other models in closed-form formulations. Since R-PCA is the simplest, our discovery makes it the center of low-rank subspace recovery models.

We have investigated the exact recovery problem of R-PCA via Outlier Pursuit.

We propose choosing the sparest solution in the solution set.