Robust Coordinate Descent Algorithm Robust Solution Path for High-dimensional Sparse Regression Modeling
From MaRDI portal
Publication:2809588
DOI10.1080/03610918.2013.854910zbMath1341.62220OpenAlexW2031496989MaRDI QIDQ2809588
No author found.
Publication date: 30 May 2016
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2013.854910
dimension reductionhigh-dimensional datacoordinate descent algorithm\(L_{1}\)-type regularizationrobust regression modeling
Related Items
Outlier-resistant high-dimensional regression modelling based on distribution-free outlier detection and tuning parameter selection, Robust logistic regression modelling via the elastic net-type regularization and tuning parameter selection
Cites Work
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Outlier detection in the multiple cluster setting using the minimum covariance determinant estimator
- Outlier identification in high dimensions
- Least angle regression. (With discussion)
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets
- Pathwise coordinate optimization
- Robust Linear Model Selection Based on Least Angle Regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Regularization and Variable Selection Via the Elastic Net
- Tuning parameter selectors for the smoothly clipped absolute deviation method
- Convergence of a block coordinate descent method for nondifferentiable minimization