Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem

DOI10.2307/2006041zbMath0423.62050OpenAlexW4235518919MaRDI QIDQ3857591

James P. Godfrey, Ronald D. Armstrong

Publication date: 1979

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

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

zbMATH Keywords

simplex algorithmsL1 norm estimateslinear discrete approximation

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Applications of mathematical programming (90C90) Linear programming (90C05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99)

Related Items (3)

Extension of some results for channel capacity using a generalized information measure ⋮ Linear programming and \(\ell _ 1\) regression: A geometric interpretation ⋮ Approximation in normed linear spaces

This page was built for publication: Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem