Coordinate majorization descent algorithm for nonconvex penalized regression
From MaRDI portal
Publication:3389674
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A coordinate descent algorithm for computing penalized smooth quantile regression
- A coordinate majorization descent algorithm for \(\ell_1\) penalized learning
- Coordinate descent algorithms for lasso penalized regression
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Extended Bayesian information criteria for model selection with large model spaces
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Least angle regression. (With discussion)
- Majorization minimization by coordinate descent for concave penalized generalized linear models
- Nearly unbiased variable selection under minimax concave penalty
- One-step sparse estimates in nonconcave penalized likelihood models
- Paths Following Algorithm for Penalized Logistic Regression Using SCAD and MCP
- Pathwise coordinate optimization
- Tuning parameter selectors for the smoothly clipped absolute deviation method
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable selection using MM algorithms
Cited in
(3)
This page was built for publication: Coordinate majorization descent algorithm for nonconvex penalized regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389674)
