Discrete approximation in the L1 norm

DOI10.1093/COMJNL/16.2.180MaRDI QIDQ5672047zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(11)

• On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians
• An algorithm for a least absolute value regression problem with bounds on the parameters
• Linear programming for weighted deviation problems using compact basis techniques
• Approximation in normed linear spaces
• Correcting data corruption errors for multivariate function approximation
• Least absolute value and chebychev estimation utilizing least squares results
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Piecewise-linear programming: The compact (CPLP) algorithm
• Nonuniqueness of least absolute values regression
• L p -methods for robust regression
• Identification of corrupted data via k-means clustering for function approximation

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

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