The perturbation analysis of nonconvex low-rank matrix robust recovery

preprint2020arXivOpen access

Abstract

In this paper, we bring forward a completely perturbed nonconvex Schatten pp-minimization to address a model of completely perturbed low-rank matrix recovery. The paper that based on the restricted isometry property generalizes the investigation to a complete perturbation model thinking over not only noise but also perturbation, gives the restricted isometry property condition that guarantees the recovery of low-rank matrix and the corresponding reconstruction error bound. In particular, the analysis of the result reveals that in the case that pp decreases 00 and a>1a>1 for the complete perturbation and low-rank matrix, the condition is the optimal sufficient condition δ2r<1δ_{2r}<1 \cite{Recht et al 2010}. The numerical experiments are conducted to show better performance, and provides outperformance of the nonconvex Schatten pp-minimization method comparing with the convex nuclear norm minimization approach in the completely perturbed scenario.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.