A survey of numerical algorithms that can solve the Lasso problems
From MaRDI portal
Publication:6602016
DOI10.1002/WICS.1602zbMATH Open1544.6217MaRDI QIDQ6602016FDOQ6602016
Publication date: 11 September 2024
Published in: Wiley Interdisciplinary Reviews. WIREs Computational Statistics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Least angle regression. (With discussion)
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Convergence of a block coordinate descent method for nondifferentiable minimization
- The solution path of the generalized lasso
- Smooth minimization of non-smooth functions
- Piecewise linear regularized solution paths
- Gradient methods for minimizing composite functions
- L 1-Regularization Path Algorithm for Generalized Linear Models
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- On the Convergence of Block Coordinate Descent Type Methods
- Linear Inversion of Band-Limited Reflection Seismograms
- Minimizing Certain Convex Functions
This page was built for publication: A survey of numerical algorithms that can solve the Lasso problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602016)
