The best parameter subset using the Chebychev curve fitting criterion

DOI10.1007/BF02591964zbMath0515.65012OpenAlexW2051943137MaRDI QIDQ3662506

P. O. Beck, Ronald D. Armstrong

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591964

zbMATH Keywords

regressionbest subsetChebychev curve fittingmin-max regression

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Linear regression; mixed models (62J05) Probabilistic methods, stochastic differential equations (65C99)

Uses Software

• AS 135

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On L1 and Chebyshev estimation
• Selection of Variables in Linear Regression Using the Minimum Sum of Weighted Absolute Errors Criterion
• A dual method for discrete Chebychev curve fitting
• Algorithm AS 135: Min-Max Estimates for a Linear Multiple Regression Problem
• Regressions by Leaps and Bounds
• Experiments in mixed-integer linear programming using pseudo-costs
• The simplex method of linear programming using LU decomposition
• Applications of Linear Programming to Numerical Analysis
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: The best parameter subset using the Chebychev curve fitting criterion