Computer Science – Information Theory
Scientific paper
2011-06-16
Computer Science
Information Theory
Scientific paper
The low-rank matrix recovery (LMR) is a rank minimization problem subject to linear equality constraints, and it arises in many fields such as signal and image processing, statistics, computer vision, system identification and control. This class of optimization problems is $\N\P$-hard and a popular approach replaces the rank function with the nuclear norm of the matrix variable. In this paper, we extend the concept of $s$-goodness for a sensing matrix in sparse signal recovery (proposed by Juditsky and Nemirovski [Math Program, 2011]) to linear transformations in LMR. Then, we give characterizations of $s$-goodness in the context of LMR. Using the two characteristic $s$-goodness constants, ${\gamma}_s$ and $\hat{\gamma}_s$, of a linear transformation, not only do we derive necessary and sufficient conditions for a linear transformation to be $s$-good, but also provide sufficient conditions for exact and stable $s$-rank matrix recovery via the nuclear norm minimization under mild assumptions. Moreover, we give computable upper bounds for one of the $s$-goodness characteristics which leads to verifiable sufficient conditions for exact low-rank matrix recovery.
Kong Lingchen
Tunçel Levent
Xiu Naihua
No associations
LandOfFree
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-190420