Stability Analysis for a Class of Sparse Optimization Problems
Abstract
The sparse optimization problems arise in many areas of science and engineering, such as compressed sensing, image processing, statistical and machine learning. The -minimization problem is one of such optimization problems, which is typically used to deal with signal recovery. The -minimization method is one of the plausible approaches for solving the -minimization problems, and thus the stability of such a numerical method is vital for signal recovery. In this paper, we establish a stability result for the -minimization problems associated with a general class of -minimization problems. To this goal, we introduce the concept of restricted weak range space property (RSP) of a transposed sensing matrix, which is a generalized version of the weak RSP of the transposed sensing matrix introduced in [Zhao et al., Math. Oper. Res., 44(2019), 175-193]. The stability result established in this paper includes several existing ones as special cases.
Cite
@article{arxiv.1904.09637,
title = {Stability Analysis for a Class of Sparse Optimization Problems},
author = {Jialiang Xu and Yun-Bin Zhao},
journal= {arXiv preprint arXiv:1904.09637},
year = {2019}
}