-Goodness for Low-Rank Matrix Recovery

Lingchen Kong, Levent Tunçel and Naihua Xiu

Abstract and Applied Analysis, 2013, vol. 2013, 1-9

Abstract:

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, and system identification and control. This class of optimization problems is generally hard. A popular approach replaces the rank function with the nuclear norm of the matrix variable. In this paper, we extend and characterize the concept of -goodness for a sensing matrix in sparse signal recovery (proposed by Juditsky and Nemirovski (Math Program, 2011)) to linear transformations in LMR. Using the two characteristic -goodness constants, and , of a linear transformation, we derive necessary and sufficient conditions for a linear transformation to be -good. Moreover, we establish the equivalence of -goodness and the null space properties. Therefore, -goodness is a necessary and sufficient condition for exact -rank matrix recovery via the nuclear norm minimization.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2013/101974.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2013/101974.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:101974

DOI: 10.1155/2013/101974

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().