On L\(_1\) and Chebyshev estimation. (English) Zbl 0271.41021
References:
| [1] | I. Barrowdale and A. Young, ”Algorithms for best L1 and Lapproximation on a discrete set”,Numerische Mathematik 8 (1966) 295–306. · Zbl 0173.18801 · doi:10.1007/BF02162565 |
| [2] | A. Charnes, W. Cooper and R.O. Ferguson, ”Optimal estimation of executive compensation by linear programming”,Management Science 1 (1955) 138–150. · Zbl 0995.90590 · doi:10.1287/mnsc.1.2.138 |
| [3] | M. Davies, ”Linear approximations using the criterion of least total deviations”,Journal of the Royal Statistical Society, Series B (1967) 101–109. |
| [4] | F.Y. Edgeworth, ”On a new method of reducing observations relating to several quantities”,Philosophical Magazine 25 (1888) 185–191. · JFM 20.0219.01 |
| [5] | F.R. Glahe and J.G. Hunt, ”The small sample properties of simultaneous equation least absolute estimators vis-a-vis least squares estimators”,Econometrica 38 (1970) 742–753. · Zbl 0205.46203 · doi:10.2307/1912204 |
| [6] | E. Stiefel, ”Über diskrete und lineare Tschebyscheff-Approximationen”,Numerische Mathematik 1 (1959) 1–28. · Zbl 0083.11501 · doi:10.1007/BF01386369 |
| [7] | E. Stiefel, ”Note on Jordan elimination, linear programming and Tschebyscheff approximation”,Numerische Mathematik 2 (1960) 1–17. · Zbl 0097.32306 · doi:10.1007/BF01386203 |
| [8] | L. Veidinger, ”On the numerical determination of the best approximation in the Chebyshev sense”,Numerische Mathematik 2 (1960) 99–105. · Zbl 0090.33702 · doi:10.1007/BF01386215 |
| [9] | H.M. Wagner, ”Linear programming techniques for regression analysis”,Journal of the American Statistical Association 54 (1957) 206–212. · Zbl 0088.35702 · doi:10.2307/2282146 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
