Approximate penalization path for smoothly clipped absolute deviation
From MaRDI portal
Publication:4912042
DOI10.1080/00949655.2010.550292zbMATH Open1318.62208OpenAlexW2022093486MaRDI QIDQ4912042FDOQ4912042
Authors: Hosik Choi, Changyi Park 
Publication date: 21 March 2013
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2010.550292
Recommendations
- Tuning parameter selectors for the smoothly clipped absolute deviation method
- Selection by partitioning the solution paths
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Smoothly clipped absolute deviation on high dimensions
- Paths Following Algorithm for Penalized Logistic Regression Using SCAD and MCP
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cites Work
- The Adaptive Lasso and Its Oracle Properties
- Least angle regression. (With discussion)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- The Concave-Convex Procedure
- Regularization and Variable Selection Via the Elastic Net
- Piecewise linear regularized solution paths
- Title not available (Why is that?)
- Smoothly clipped absolute deviation on high dimensions
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Efficient Computation and Model Selection for the Support Vector Regression
Cited In (2)
Uses Software
This page was built for publication: Approximate penalization path for smoothly clipped absolute deviation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912042)
