Structured Sparsity Promoting Functions
Not on the map. Why?
Abstract (arXiv)
Motivated by the minimax concave penalty based variable selection in high-dimensional linear regression, we introduce a simple scheme to construct structured semiconvex sparsity promoting functions from convex sparsity promoting functions and their Moreau envelopes. Properties of these functions are developed by leveraging their structure. In particular, we provide sparsity guarantees for the general family of functions. We further study the behavior of the proximity operators of several special functions including indicator functions of closed convex sets, piecewise quadratic functions, and the linear combinations of them. To demonstrate these properties, several concrete examples are presented and existing instances are featured as special cases.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 2.
4 papers.
- 2024Sparse Deep Learning Models with the ℓ1 Regularizationcited by 1
- 2025Douglas-Rachford Splitting for Group-Sparse Feedback Linear-Quadratic Controlcited by 0
- 2026A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimationcited by 0
- 2026MG-SpaIR: Multi-grade Sparse-guided Implicit Representation for Training-Data-Free Image Restorationcited by 0
- 2026MG-SpaIR: Multi-grade Sparse-guided Implicit Representation for Training-Data-Free Image Restoration30 Jun 2026
- 2026A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation29 Jan 2026
- 2025Douglas-Rachford Splitting for Group-Sparse Feedback Linear-Quadratic Control26 Jul 2025
- 2024Sparse Deep Learning Models with the ℓ1 Regularization5 Aug 2024