An Efficient Method for the Discrete Linear L 1 Approximation Problem
From MaRDI portal
Publication:4064967
DOI10.2307/2005296zbMath0307.65052OpenAlexW4252862633MaRDI QIDQ4064967
Publication date: 1975
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2005296
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Algorithms for approximation of functions (65D15) Acceleration of convergence in numerical analysis (65B99)
Related Items (7)
Piecewise-linear programming: The compact (CPLP) algorithm ⋮ Robust estimation based on the least absolute deviations method and the Kalman filter ⋮ Lagrangian approach for large-scale least absolute value estimation ⋮ Linear programming and \(\ell _ 1\) regression: A geometric interpretation ⋮ Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes ⋮ Linear programming for weighted deviation problems using compact basis techniques ⋮ Approximation in normed linear spaces
This page was built for publication: An Efficient Method for the Discrete Linear L 1 Approximation Problem
