A Comparison of Two Algorithms for Absolute Deviation Curve Fitting

DOI10.2307/2285306MaRDI QIDQ4113268zbMATH OpenOpenAlexFDO

Authors Edward L. Frome, Ronald D. Armstrong

Publication date 1976

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

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Numerical smoothing, curve fitting (65D10) Linear programming (90C05)

Cited in

(8)

• On the use of the simplex algorithm for the absolute deviation curve fitting problem
• Lagrangian approach for large-scale least absolute value estimation
• Robust autoregressive estimates using quadratic programming
• Interactions and outliers in the two-way analysis of variance
• Robust estimation based on the least absolute deviations method and the Kalman filter
• Least absolute value and chebychev estimation utilizing least squares results
• On l₁regression coeficients
• Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes

This page was built for publication: A Comparison of Two Algorithms for Absolute Deviation Curve Fitting

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