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

DOI10.2307/2346829MaRDI QIDQ3902452zbMATH OpenOpenAlexFDO

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

linear multiple regression problemlinear programming dual methodmin-max estimatessimplex algorithm

Mathematics Subject Classification ID

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

Cited in

(9)

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

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)