A Unified Framework for Solving a General Class of Nonconvexly Regularized Convex Models
arXiv:2306.14663 · doi:10.1109/TSP.2023.3315449
Abstract
Recently, several nonconvex sparse regularizers which can preserve the convexity of the cost function have received increasing attention. This paper proposes a general class of such convexity-preserving (CP) regularizers, termed partially smoothed difference-of-convex (pSDC) regularizer. The pSDC regularizer is formulated as a structured difference-of-convex (DC) function, where the landscape of the subtrahend function can be adjusted by a parameterized smoothing function so as to attain overall-convexity. Assigned with proper building blocks, the pSDC regularizer reproduces existing CP regularizers and opens the way to a large number of promising new ones. With respect to the resultant nonconvexly regularized convex (NRC) model, we derive a series of overall-convexity conditions which naturally embrace the conditions in previous works. Moreover, we develop a unified framework based on DC programming for solving the NRC model. Compared to previously reported proximal splitting type approaches, the proposed framework makes less stringent assumptions. We establish the convergence of the proposed framework to a global minimizer. Numerical experiments demonstrate the power of the pSDC regularizers and the efficiency of the proposed DC algorithm.
arXiv comment15 pages, 6 figures, submitted to journal
References in corpus (6)
- Nearly unbiased variable selection under minimax concave penalty
- Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Sparse Regularization via Convex Analysis
- Enhanced Low-Rank Matrix Approximation
- Linearly Involved Generalized Moreau Enhanced Models and Their Proximal Splitting Algorithm under Overall Convexity Condition
- An Inexact Proximal Linearized DC Algorithm with Provably Terminating Inner Loop