Solving constrained nonsmooth group sparse optimization via group Capped-_1 relaxation and group smoothing proximal gradient algorithm
From MaRDI portal
Publication:6043130
Recommendations
- scientific article; zbMATH DE number 7594592
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Sparse optimization for nonconvex group penalized estimation
- An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems
- Group coordinate descent algorithms for nonconvex penalized regression
Cites work
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- A selective review of group selection in high-dimensional models
- A unified view of exact continuous penalties for _2-_0 minimization
- Analysis of multi-stage convex relaxation for sparse regularization
- Computation of second-order directional stationary points for group sparse optimization
- Computing B-stationary points of nonsmooth DC programs
- Convex Analysis
- DC approximation approaches for sparse optimization
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- Group coordinate descent algorithms for nonconvex penalized regression
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Nearly unbiased variable selection under minimax concave penalty
- Nonconcave penalized likelihood with a diverging number of parameters.
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Optimization problems involving group sparsity terms
- Probing the Pareto frontier for basis pursuit solutions
- Sparse Approximate Solutions to Linear Systems
- Sparse optimization for nonconvex group penalized estimation
- Statistical challenges with high dimensionality: feature selection in knowledge discovery
- The benefit of group sparsity
- The Group Lasso for Logistic Regression
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
Cited in
(11)- Optimization problems involving group sparsity terms
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- scientific article; zbMATH DE number 7594592 (Why is no real title available?)
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Computation of second-order directional stationary points for group sparse optimization
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Group sparse structural smoothing recovery: model, statistical properties and algorithm
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- Smoothing proximal gradient block-coordinate algorithms for group sparse _0 regularized nonsmooth convex regression problem
- Nonconvex truncated conditional value at risk-based sparse linear regression
- Optimality conditions for group sparsity constrained optimization problems with equality and inequality constraints
This page was built for publication: Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043130)
