A Primal Dual Active Set Algorithm for a Class of Nonconvex Sparsity Optimization
share
In this paper, we consider the problem of recovering a sparse vector from noisy measurement data. Traditionally, it is formulated as a penalized least-squares problem with an ℓ^1 penalty. Recent studies show that nonconvex penalties, e.g., ℓ^0 and bridge, allow more effective sparse recovery. We develop an algorithm of primal dual active set type for a class of nonconvex sparsity-promoting penalties, which cover ℓ^0, bridge, smoothly clipped absolute deviation, capped ℓ^1 and minimax concavity penalty. First we establish the existence of a global minimizer for the class of optimization problems. Then we derive a novel necessary optimality condition for the global minimizer using the associated thresholding operator. The solutions to the optimality system are coordinate-wise minimizers, and under minor conditions, they are also local minimizers. Upon introducing the dual variable, the active set can be determined from the primal and dual variables. This relation lends itself to an iterative algorithm of active set type which at each step involves updating the primal variable only on the active set and then updating the dual variable explicitly. When combined with a continuation strategy on the regularization parameter, it has a global convergence property under the restricted isometry property. Extensive numerical experiments demonstrate its efficiency and accuracy.
READ FULL TEXT