Group coordinate descent algorithms for nonconvex penalized regression

DOI10.1016/J.CSDA.2011.08.007zbMath1239.62082OpenAlexW2033906179MaRDI QIDQ425386

Fengrong Wei, Hongxiao Zhu

Publication date: 8 June 2012

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2011.08.007

zbMATH Keywords

high dimensionsminimax concave penaltygrouping structuresmoothly clipped absolute deviation penalty

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Generalized linear models (logistic models) (62J12) Minimax problems in mathematical programming (90C47)

Related Items (15)

Penalized variable selection in competing risks regression ⋮ A random-effect model approach for group variable selection ⋮ Variable Selection for Multiple Function-on-Function Linear Regression ⋮ Multiple graph regularized nonnegative matrix factorization ⋮ 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 ⋮ Unnamed Item ⋮ A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems ⋮ Computation of second-order directional stationary points for group sparse optimization ⋮ Stochastic DCA for Sparse Multiclass Logistic Regression ⋮ APPLE: approximate path for penalized likelihood estimators ⋮ Sparse optimization for nonconvex group penalized estimation ⋮ Multiple graph regularized graph transduction via greedy gradient Max-Cut ⋮ Group penalized quantile regression ⋮ A group VISA algorithm for variable selection

Uses Software

• PDCO
• glmnet
• S+WAVELETS

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• Consistent group selection in high-dimensional linear regression
• One-step sparse estimates in nonconcave penalized likelihood models
• The sparsity and bias of the LASSO selection in high-dimensional linear regression
• Variable selection in nonparametric additive models
• Estimating the dimension of a model
• Heuristics of instability and stabilization in model selection
• Least angle regression. (With discussion)
• Pathwise coordinate optimization
• Coordinate descent algorithms for lasso penalized regression
• The Group Lasso for Logistic Regression
• Atomic Decomposition by Basis Pursuit
• Understanding WaveShrink: variance and bias estimation
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Model Selection and Estimation in Regression with Grouped Variables

This page was built for publication: Group coordinate descent algorithms for nonconvex penalized regression