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

DOI10.2307/2006041zbMATH Open0423.62050OpenAlexW4235518919MaRDI QIDQ3857591FDOQ3857591

Authors: 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) Direct numerical methods for linear systems and matrix inversion (65F05) Linear programming (90C05) Applications of mathematical programming (90C90) Numerical linear algebra (65F99)

Cited In (3)

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

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

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