Algorithm AS 135: Min-Max Estimates for a Linear Multiple Regression Problem

DOI10.2307/2346829MaRDI QIDQ3902452zbMATHOpenAlexFDO

Authors David S. Kung, Ronald D. Armstrong

Publication date 1979

Published in Applied Statistics (Search for Journal in Brave)

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

zbMATH Keywords

simplex algorithmmin-max estimateslinear multiple regression problemlinear programming dual method

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Probabilistic methods, stochastic differential equations (65C99) Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(9)

• Probabilistic-statistical programs from ``Applied Statistics
• The best parameter subset using the Chebychev curve fitting criterion
• Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression
• A piecewise linear approximation procedure forL_pnorm curve fitting
• A dual method for discrete Chebychev curve fitting
• Least absolute value and chebychev estimation utilizing least squares results
• AS 135
• On a class of interval predictor models with universal reliability
• Multiple criteria linear regression

This page was built for publication: Algorithm AS 135: Min-Max Estimates for a Linear Multiple Regression Problem

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