A new active zero set descent algorithm for least absolute deviation with generalized LASSO penalty
From MaRDI portal
Publication:6101007
Cites work
- A descent algorithm for constrained LAD-Lasso estimation with applications in portfolio selection
- A semismooth Newton method for \(\mathrm{L}^1\) data fitting with automatic choice of regularization parameters and noise calibration
- A simple and efficient algorithm for fused lasso signal approximator with convex loss function
- An algorithm for iterative selection of blocks of features
- An efficient primal-dual method for L^1TV image restoration
- An Improved Algorithm for Discrete l₁ Linear Approximation
- An Overview of the Minimum Sum of Absolute Errors Regression
- Asymptotic analysis of high-dimensional LAD regression with Lasso smoother
- Coordinate descent algorithms for lasso penalized regression
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- On the ``degrees of freedom of the lasso
- Properties and refinements of the fused Lasso
- Regression Quantiles
- SCAD-penalized least absolute deviation regression in high-dimensional models
- Spatial smoothing and hot spot detection for CGH data using the fused lasso
- The L₁ penalized LAD estimator for high dimensional linear regression
- The Adaptive Lasso and Its Oracle Properties
- The generalized Lasso problem and uniqueness
- The LAD estimation of the change-point linear model with randomly censored data
- The Minimum Sum of Absolute Errors Regression: A State of the Art Survey
- The solution path of the generalized lasso
This page was built for publication: A new active zero set descent algorithm for least absolute deviation with generalized LASSO penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101007)
