Model selection with distributed SCAD penalty

DOI10.1080/02664763.2017.1401052OpenAlexW2770398629MaRDI QIDQ5036460

Puyu Wang, Hai Zhang, Yong Liang

Publication date: 23 February 2022

Published in: Journal of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02664763.2017.1401052

zbMATH Keywords

nonconvexsparseSCADdistributedADMM algorithm

Mathematics Subject Classification ID

Applications of statistics (62Pxx)

Related Items

Distributed penalized modal regression for massive data

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• The Adaptive Lasso and Its Oracle Properties
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Estimating the dimension of a model
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Nonconcave penalized likelihood with a diverging number of parameters.
• Network exploration via the adaptive LASSO and SCAD penalties
• Pathwise coordinate optimization
• Atomic Decomposition by Basis Pursuit
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Uncertainty principles and ideal atomic decomposition
• Distributed Sparse Linear Regression
• L 1/2 regularization
• Smoothly Clipped Absolute Deviation on High Dimensions
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Compressed sensing
• Convergence of a block coordinate descent method for nondifferentiable minimization