Weak stability of l_1-minimization methods in sparse data reconstruction

Abstract

As one of the most plausible convex optimization methods for sparse data reconstruction, l_1-minimization plays a fundamental role in the development of sparse optimization theory. The stability of this method has been addressed in the literature under various assumptions such as the restricted isometry property, null space property, and mutual coherence. In this paper, we propose a unified means to develop the so-called weak stability theory for 1-minimization methods under the condition called the weak range space property of a transposed design matrix, which turns out to be a necessary and sufficient condition for the standard l_1-minimization method to be weakly stable in sparse data reconstruction. The reconstruction error bounds established in this paper are measured by the so-called Robinson’s constant. We also provide a unified weak stability result for standard l_1-minimization under several existing compressed sensing matrix properties. In particular, the weak stability of l_1-minimization under the constant-free range space property of order k of the transposed design matrix is established for the first time in this paper. Different from the existing analysis, we utilize the classic Ho˙man’s lemma concerning the error bound of linear systems as well as Dudley’s theorem concerning the polytope approximation of the unit l_2-ball to show that l_1-minimization is robustly and weakly stable in recovering sparse data from inaccurate measurements.