Outlier-Robust Matrix Completion via $\ell _p$ -Minimization

@article{Zeng2018OutlierRobustMC,
  title={Outlier-Robust Matrix Completion via \$\ell _p\$ -Minimization},
  author={Wen-Jun Zeng and Hing Cheung So},
  journal={IEEE Transactions on Signal Processing},
  year={2018},
  volume={66},
  pages={1125-1140}
}
Matrix completion refers to recovering a low-rank matrix from only a subset of its possibly noisy entries, and has a variety of important applications because many real-world signals can be modeled by a <inline-formula> <tex-math notation="LaTeX">$n_1 \times n_2$</tex-math></inline-formula> matrix with rank <inline-formula> <tex-math notation="LaTeX">$r \ll… CONTINUE READING