The best parameter subset using the Chebychev curve fitting criterion

DOI10.1007/BF02591964MaRDI QIDQ3662506zbMATH OpenOpenAlexFDO

Authors 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

best subsetChebychev curve fittingmin-max regressionregression

Mathematics Subject Classification ID

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

Cites work

• A dual method for discrete Chebychev curve fitting
• Algorithm AS 135: Min-Max Estimates for a Linear Multiple Regression Problem
• Applications of Linear Programming to Numerical Analysis
• Experiments in mixed-integer linear programming using pseudo-costs
• scientific article; zbMATH DE number 3827006 (Why is no real title available?)
• scientific article; zbMATH DE number 3829087 (Why is no real title available?)
• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• scientific article; zbMATH DE number 3596100 (Why is no real title available?)
• scientific article; zbMATH DE number 3254517 (Why is no real title available?)
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• On L1 and Chebyshev estimation
• Regressions by Leaps and Bounds
• Selection of Variables in Linear Regression Using the Minimum Sum of Weighted Absolute Errors Criterion
• The simplex method of linear programming using LU decomposition

Describes a project that uses

Uses Software

• AS 135

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

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