\(s\)-goodness for low-rank matrix recovery (Q369686): Difference between revisions

Summary: 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 \(\mathcal{NP}\) 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 \(s\)-goodness for a sensing matrix in sparse signal recovery (proposed by \textit{A. Juditsky} et al. [Math. Program. 127, No. 1 (B), 89--122 (2011; Zbl 1211.90332)]) to linear transformations in LMR. Using the two characteristic \(s\)-goodness constants, \(\gamma_s\) and \(\hat{\gamma}_s\), of a linear transformation, we derive necessary and sufficient conditions for a linear transformation to be \(s\)-good. Moreover, we establish the equivalence of \(s\)-goodness and the null space properties. Therefore, \(s\)-goodness is a necessary and sufficient condition for exact \(s\)-rank matrix recovery via the nuclear norm minimization.