An Optimal Condition of Robust Low-rank Matrices Recovery
Information Theory
2020-03-11 v1 math.IT
Abstract
In this paper we investigate the reconstruction conditions of nuclear norm minimization for low-rank matrix recovery. We obtain sufficient conditions with to guarantee the robust reconstruction or exact reconstruction of all rank matrices from via nuclear norm minimization. Furthermore, we not only show that when , the upper bound of is the same as the result of Cai and Zhang \cite{Cai and Zhang}, but also demonstrate that the gained upper bounds concerning the recovery error are better. Moreover, we prove that the restricted isometry property condition is sharp. Besides, the numerical experiments are conducted to reveal the nuclear norm minimization method is stable and robust for the recovery of low-rank matrix.
Keywords
Cite
@article{arxiv.2003.04766,
title = {An Optimal Condition of Robust Low-rank Matrices Recovery},
author = {Jianwen Huang and Jianjun Wang and Feng Zhang and Wendong Wang},
journal= {arXiv preprint arXiv:2003.04766},
year = {2020}
}