Sparse Solutions of a Class of Constrained Optimization Problems

Abstract

In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing [Formula: see text] subject to [Formula: see text] for given [Formula: see text] and [Formula: see text]. We then study various properties of the optimal solutions of this problem. Specifically, without any condition on the matrix A, we provide upper bounds in cardinality and infinity norm for the optimal solutions and show that all optimal solutions must be on the boundary of the feasible set when [Formula: see text]. Moreover, for [Formula: see text], we show that the problem with [Formula: see text] has a finite number of optimal solutions and prove that there exists [Formula: see text] such that the solution set of the problem with any [Formula: see text] is contained in the solution set of the problem with p = 0, and there further exists [Formula: see text] such that the solution set of the problem with any [Formula: see text] remains unchanged. An estimation of such [Formula: see text] is also provided. In addition, to solve the constrained nonconvex non-Lipschitz Lp-L1problem ([Formula: see text] and q = 1), we propose a smoothing penalty method and show that, under some mild conditions, any cluster point of the sequence generated is a stationary point of our problem. Some numerical examples are given to implicitly illustrate the theoretical results and show the efficiency of the proposed algorithm for the constrained Lp-L1problem under different noises.