A generalized formulation for group selection via ADMM (Q6571367)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A generalized formulation for group selection via ADMM

scientific article; zbMATH DE number 7880206

Language	Label	Description	Also known as
default for all languages	No label defined
English	A generalized formulation for group selection via ADMM	scientific article; zbMATH DE number 7880206

Statements

instance of

scholarly article

0 references

title

A generalized formulation for group selection via ADMM (English)

0 references

0 references

0 references

0 references

0 references

Journal of Scientific Computing

0 references

publication date

12 July 2024

0 references

zbMATH Keywords

ADMM

0 references

group sparsity

0 references

group variable selection

0 references

nonconvex programming

0 references

directional stationary solutions

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5558293

0 references

Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations

0 references

Difference-of-convex learning: directional stationarity, optimality, and sparsity

0 references

Optimization with sparsity-inducing penalties

0 references

First-order methods in optimization

0 references

Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors

0 references

Enhancing sparsity by reweighted $\ell _{1}$ minimization

0 references

A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

ADMM for High-Dimensional Sparse Penalized Quantile Regression

0 references

10.1162/153244303322753616

0 references

The Elements of Statistical Learning

0 references

Q5251797

0 references

Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems

0 references

Iteration complexity analysis of block coordinate descent methods

0 references

A selective review of group selection in high-dimensional models

0 references

Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm

0 references

Iteratively reweighted group Lasso based on log-composite regularization

0 references

Convergence guarantees for a class of non-convex and non-smooth optimization problems

0 references

Improved iteratively reweighted least squares for unconstrained smoothed $\ell_q$ minimization

0 references

Finding sparse solutions of systems of polynomial equations via group-sparsity optimization

0 references

Variations and extension of the convex-concave procedure

0 references

Regularized $M$-estimators with nonconvexity: statistical and algorithmic theory for local optima

0 references

Fast L1-L2 minimization via a proximal operator

0 references

Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$

0 references

Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization

0 references

The Group Lasso for Logistic Regression

0 references

A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers

0 references

Local Strong Homogeneity of a Regularized Estimator

0 references

Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions

0 references

Computing B-stationary points of nonsmooth DC programs

0 references

Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

Group variable selection via $\ell_{p,0}$ regularization and application to optimal scoring

0 references

A Scale-Invariant Approach for Sparse Signal Recovery

0 references

Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms

0 references

A unified convergence analysis of block successive minimization methods for nonsmooth optimization

0 references

Lectures on Stochastic Programming

0 references

Q4864293

0 references

A bundle method for nonsmooth DC programming with application to chance-constrained problems

0 references

Accelerated Schemes for the $L_1/L_2$ Minimization

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

Coordinate majorization descent algorithm for nonconvex penalized regression

0 references

Group coordinate descent algorithms for nonconvex penalized regression

0 references

On inexact ADMMs with relative error criteria

0 references

An inexact alternating direction method of multipliers with relative error criteria

0 references

Tractable ADMM schemes for computing KKT points and local minimizers for $\ell_0$-minimization problems

0 references

Minimization of $\ell_{1-2}$ for compressed sensing

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Minimization of transformed $l_1$ penalty: closed form representation and iterative thresholding algorithms

0 references

Minimization of transformed $L_1$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing

0 references

An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

0 references

copyright license

Creative Commons Attribution 4.0 International

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10915-024-02571-9

0 references

Sitelinks

Mathematics(1 entry)

mardi A generalized formulation for group selection via ADMM