A generalized formulation for group selection via ADMM
From MaRDI portal
(Redirected from Publication:6571367)
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- 10.1162/153244303322753616
- A Scale-Invariant Approach for Sparse Signal Recovery
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- A selective review of group selection in high-dimensional models
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Accelerated Schemes for the $L_1/L_2$ Minimization
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- An inexact alternating direction method of multipliers with relative error criteria
- Computing B-stationary points of nonsmooth DC programs
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Coordinate majorization descent algorithm for nonconvex penalized regression
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast L1-L2 minimization via a proximal operator
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- First-order methods in optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- Group coordinate descent algorithms for nonconvex penalized regression
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Iteration complexity analysis of block coordinate descent methods
- Iteratively reweighted group Lasso based on log-composite regularization
- Lectures on Stochastic Programming
- Local Strong Homogeneity of a Regularized Estimator
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
- Model Selection and Estimation in Regression with Grouped Variables
- Nearly unbiased variable selection under minimax concave penalty
- On inexact ADMMs with relative error criteria
- Optimization with sparsity-inducing penalties
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- The Elements of Statistical Learning
- The Group Lasso for Logistic Regression
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variations and extension of the convex-concave procedure
Cited in
(1)
This page was built for publication: A generalized formulation for group selection via ADMM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571367)
