An Efficient Method for the Discrete Linear L 1 Approximation Problem

DOI10.2307/2005296MaRDI QIDQ4064967zbMATH OpenOpenAlexFDO

Authors Nabih N. Abdelmalek

Publication date 1975

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2005296

Mathematics Subject Classification ID

Acceleration of convergence in numerical analysis (65B99) Algorithms for approximation of functions (65D15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90)

Cited in

(7)

• Lagrangian approach for large-scale least absolute value estimation
• Linear programming for weighted deviation problems using compact basis techniques
• Approximation in normed linear spaces
• Robust estimation based on the least absolute deviations method and the Kalman filter
• Piecewise-linear programming: The compact (CPLP) algorithm
• Linear programming and \(\ell _ 1\) regression: A geometric interpretation
• Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes

This page was built for publication: An Efficient Method for the Discrete Linear L 1 Approximation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4064967)