Sparse optimization for nonconvex group penalized estimation
From MaRDI portal
Publication:5222360
Recommendations
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Sparse group variable selection via two nonconvex penalized regression models
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
- Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
- Group coordinate descent algorithms for nonconvex penalized regression
- Penalized least square in sparse setting with convex penalty and non Gaussian errors
- An Iterative Sparse-Group Lasso
- Sparsity in penalized empirical risk minimization
- A Penalty Function Promoting Sparsity Within and Across Groups
Cites work
- scientific article; zbMATH DE number 5957380 (Why is no real title available?)
- scientific article; zbMATH DE number 47282 (Why is no real title available?)
- scientific article; zbMATH DE number 47310 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A selective review of group selection in high-dimensional models
- Blockwise sparse regression
- Component selection and smoothing in multivariate nonparametric regression
- Consistent group selection in high-dimensional linear regression
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Efficient block-coordinate descent algorithms for the group Lasso
- Estimating Optimal Transformations for Multiple Regression and Correlation
- Global optimality of nonconvex penalized estimators
- Group coordinate descent algorithms for nonconvex penalized regression
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Model Selection and Estimation in Regression with Grouped Variables
- Nearly unbiased variable selection under minimax concave penalty
- On ψ-Learning
- Pathwise coordinate optimization
- Quadratic approximation for nonconvex penalized estimations with a diverging number of parameters
- Semiparametric regression pursuit
- Smoothly clipped absolute deviation on high dimensions
- The Concave-Convex Procedure
- The benefit of group sparsity
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(24)- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- High-dimensional grouped folded concave penalized estimation via the LLA algorithm
- Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
- Sparse group Lasso and high dimensional multinomial classification
- Group sparse structural smoothing recovery: model, statistical properties and algorithm
- Group coordinate descent algorithms for nonconvex penalized regression
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- An iterative algorithm for fitting nonconvex penalized generalized linear models with grouped predictors
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- Penalized least square in sparse setting with convex penalty and non Gaussian errors
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization
- Group sparse optimization for learning predictive state representations
- scientific article; zbMATH DE number 7594592 (Why is no real title available?)
- Computation of second-order directional stationary points for group sparse optimization
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Efficient block-coordinate descent algorithms for the group Lasso
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- A lower bound based smoothed quasi-Newton algorithm for group bridge penalized regression
- SparseNet: coordinate descent with nonconvex penalties
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- Sparse functional linear models via calibrated concave-convex procedure
This page was built for publication: Sparse optimization for nonconvex group penalized estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222360)
