An Improved Algorithm for Discrete $l_1 $ Linear Approximation
I. Barrodale, F. D. K. Roberts · SIAM Journal on Numerical Analysis · 1973
By modifying the simplex method of linear programming, we are able to present an algorithm for $l_1 $-approximation which appears to, be superior computationally to any other known algorithm for this problem.
Cited by 601 works. doi:10.1137/0710069
Authors
References
- Linear Programming and Extensions
- Linear Programming Techniques for Regression Analysis
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete set
- Norms for Smoothing and Estimation
- Applications of Linear Programming to Numerical Analysis
- Computing Best lp Approximations by Functions Nonlinear in One Parameter
- L 1 Approximation and the Analysis of Data
- Applications of Mathematical Programming to ℓp Approximation
- An interval programming algorithm for discrete linear L1 approximation problems
- On $L_1 $ Approximation II: Computation for Discrete Functions and Discretization Effects