Discrete approximation in the L1 norm

DOI10.1093/comjnl/16.2.180zbMath0257.65015OpenAlexW2046661878MaRDI QIDQ5672047

No author found.

Publication date: 1973

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/16.2.180

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Algorithms for approximation of functions (65D15)

Related Items (10)

A simplex algorithm for piecewise-linear programming I: Derivation and proof ⋮ On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians ⋮ Piecewise-linear programming: The compact (CPLP) algorithm ⋮ An algorithm for a least absolute value regression problem with bounds on the parameters ⋮ Least absolute value and chebychev estimation utilizing least squares results ⋮ Nonuniqueness of least absolute values regression ⋮ Linear programming for weighted deviation problems using compact basis techniques ⋮ Correcting Data Corruption Errors for Multivariate Function Approximation ⋮ Approximation in normed linear spaces ⋮ L p -methods for robust regression

This page was built for publication: Discrete approximation in the L1 norm