On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians

DOI10.1016/0167-9473(87)90051-XzbMath0633.90047OpenAlexW2011445502MaRDI QIDQ1096541

Charles R. McConnell

Publication date: 1987

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(87)90051-x

zbMATH Keywords

least absolute valuelinear discrete \(L_ 1\) approximationmethod of vanishing Jacobians

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (1)

Least absolute value regression: recent contributions

Cites Work

• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Nonuniqueness of least absolute values regression
• An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
• Generalization of Sverdrup's Lemma and its Applications to Multivariate Distribution Theory
• The least squares problem and pseudo-inverses
• On an algorithm for discrete nonlinear L1 approximation
• Discrete approximation in the L1 norm
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians