Solving the Robust Matrix Completion Problem via a System of Nonlinear Equations

24 Mar 2020Yunfeng CaiPing Li

We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix completion problem is transformed into a problem of solving a system of nonlinear equations, and the alternative direction method is then used to solve the nonlinear equations... (read more)

PDF Abstract