scientific article; zbMATH DE number 7594592
From MaRDI portal
Publication:5037987
Recommendations
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Sparse optimization for nonconvex group penalized estimation
- Optimization problems involving group sparsity terms
- An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Equivalent Lipschitz optimization model for the group zero-norm regularized problem
- The linearized alternating direction method of multipliers for sparse group LAD model
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 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
- 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
(5)- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Equivalent Lipschitz optimization model for the group zero-norm regularized problem
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Solution sets of three sparse optimization problems for multivariate regression
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037987)
