.png){kind=icon}
Return
Smoothing Functions for Sparse Optimization: A Unified Framework
.png){kind=icon}
OA
AI
DOI：10.1007/s10957-026-02975-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a unified framework for constructing smoothing functions tailored to a broad class of widely used regularizers, including the plus function, the pinball function, the & ell;(0)-norm, the & ell;(p)-norm for 0 < p <= 1, the MCP, and the SCAD. By transforming nonsmooth regularizers into smooth approximations, the proposed framework facilitates the application of efficient optimization algorithms to sparse optimization problems. The framework is systematically derived from continuous approximations of the step function, offering a principled approach to generating smoothing functions across various regularizers. These approximations are, in turn, constructed using polynomial functions and the Dirac delta function.
Keywords:
Regularizer
Regularized function
Smoothing function
Journal
J
IF:
1.5
Papers:
184
Citations:
8.2K
Organization
Cited Papers
ShareSavePositive Definite Estimation of Large Covariance Matrix Using Generalized Nonconvex Penalties.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveA Survey on Nonconvex Regularization-Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine LearningIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSave
View more