Algorithms for unconstrained L_ 1 simple linear regression
From MaRDI portal
Algorithms for unconstrained \(L 1\) simple linear regression
Cites work
- scientific article; zbMATH DE number 3852235 (Why is no real title available?)
- scientific article; zbMATH DE number 3600959 (Why is no real title available?)
- L 1 solution of overdetermined systems of linear equations
- A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations
- A Method for Minimizing the Sum of Absolute Values of Deviations
- A Test Problem Generator for Discrete Linear L 1 Approximation Problems
- A new descent algorithm for the least absolute value regression problem
- A revised simplex algorithm for the absolute deviation curve fitting problem
- Algorithm AS 132: Least Absolute Value Estimates for a Simple Linear Regression Problem
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression
- Least Absolute Deviations Curve-Fitting
- Least absolute value estimation in regression models: an annotated bibliography
- Linear Curve Fitting Using Least Deviations
- Linear Programming Techniques for Regression Analysis
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- On least absolute values estimation
- Optimal estimation of executive compensation by linear programming
Cited in
(4)
This page was built for publication: Algorithms for unconstrained \(L_ 1\) simple linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804173)