2016
Low-Rank and Sparse Structure Pursuit via Alternating Minimization
AISTATS 2016poster
In this paper, we present a nonconvex alternating minimization optimization algorithm for low-rank and sparse structure pursuit. Compared with convex relaxation based methods, the proposed algorithm is computationally more efficient for large scale problems. In our study, we define a notion of bo…