Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes

DOI10.1016/0305-0548(87)90040-2zbMath0626.90075OpenAlexW2245356389WikidataQ111899765 ScholiaQ111899765MaRDI QIDQ581249

P. B. Saunders, Paul D. Domich, Karla L. Hoffman, Richard H. F. Jackson, Douglas R. Shier

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90040-2

zbMATH Keywords

performance measurescomputational experimentbest discrete \(L_ 1\) approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Algorithms for approximation of functions (65D15)

Related Items

Lagrangian approach for large-scale least absolute value estimation, An exterior-point method for linear programming problems, An exterior point method for the convex programming problem

Uses Software

• Algorithm 478
• Algorithm 564

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On L1 and Chebyshev estimation
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• Generators for discrete polynomial L1 approximation problems
• A Test Problem Generator for Discrete Linear L ₁ Approximation Problems
• An Efficient Method for the Discrete Linear L 1 Approximation Problem
• A Comparison of Two Algorithms for Absolute Deviation Curve Fitting
• Nonuniqueness of least absolute values regression
• On least absolute values estimation
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• A General Qualitative Definition of Robustness
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• Norms for Smoothing and Estimation