  In this paper we propose a novel optimization framework to systematically
solve robust PCA problem with rigorous theoretical guarantee, based on which we
investigate very computationally economic updating algorithms.
