On the use of the simplex algorithm for the absolute deviation curve fitting problem

DOI10.1016/0377-2217(84)90108-5zbMath0523.65013OpenAlexW1984525526MaRDI QIDQ1056519

J. Hammerton, John T. Buchanan

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90108-5

zbMATH Keywords

simplex algorithmabsolute deviation curve fittinglinear curve-fitting problem

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• Optimal Estimation of Executive Compensation by Linear Programming
• Linear Programming Techniques for Regression Analysis
• A revised simplex algorithm for the absolute deviation curve fitting problem
• A Comparison of Two Algorithms for Absolute Deviation Curve Fitting
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• An Iterative Technique for Absolute Deviations Curve Fitting
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Linear L ₁ Approximation for a Discrete Point Set and L ₁ Solutions of Overdetermined Linear Equations
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation

This page was built for publication: On the use of the simplex algorithm for the absolute deviation curve fitting problem