Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
DOI10.1007/s10589-022-00419-2zbMath1518.90087OpenAlexW4307157083MaRDI QIDQ6043130
Publication date: 4 May 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00419-2
exact continuous relaxationconstrained group sparse optimizationgroup Capped-\(\ell_1\) relaxationgroup smoothing proximal gradient algorithmlifted stationary points
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- DC approximation approaches for sparse optimization
- Group coordinate descent algorithms for nonconvex penalized regression
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- The benefit of group sparsity
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- Nonconcave penalized likelihood with a diverging number of parameters.
- Optimization problems involving group sparsity terms
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Computing B-Stationary Points of Nonsmooth DC Programs
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Probing the Pareto Frontier for Basis Pursuit Solutions
- The Group Lasso for Logistic Regression
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Sparse Approximate Solutions to Linear Systems
- Computation of second-order directional stationary points for group sparse optimization
- Sparse optimization for nonconvex group penalized estimation
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Group sparse optimization via $\ell_{p,q}$ regularization
- Model Selection and Estimation in Regression with Grouped Variables
- Convex Analysis
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- A selective review of group selection in high-dimensional models
This page was built for publication: Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
