DeepAI
Log In Sign Up

An Optimal Condition of Robust Low-rank Matrices Recovery

03/10/2020
by   Jianwen Huang, et al.
0

In this paper we investigate the reconstruction conditions of nuclear norm minimization for low-rank matrix recovery. We obtain sufficient conditions δ_tr<t/(4-t) with 0<t<4/3 to guarantee the robust reconstruction (z≠0) or exact reconstruction (z=0) of all rank r matrices X∈R^m× n from b=A(X)+z via nuclear norm minimization. Furthermore, we not only show that when t=1, the upper bound of δ_r<1/3 is the same as the result of Cai and Zhang <cit.>, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/11/2020

The perturbation analysis of nonconvex low-rank matrix robust recovery

In this paper, we bring forward a completely perturbed nonconvex Schatte...
02/14/2018

Necessary and Sufficient Null Space Condition for Nuclear Norm Minimization in Low-Rank Matrix Recovery

Low-rank matrix recovery has found many applications in science and engi...
07/14/2014

Performance Guarantees for Schatten-p Quasi-Norm Minimization in Recovery of Low-Rank Matrices

We address some theoretical guarantees for Schatten-p quasi-norm minimiz...
06/05/2013

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices

This paper considers compressed sensing and affine rank minimization in ...
10/23/2020

On the robustness of noise-blind low-rank recovery from rank-one measurements

We prove new results about the robustness of well-known convex noise-bli...