Using the least squares estimator in Chebyshev estimation
- 1 January 1980
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- Vol. 9 (1) , 43-49
- https://doi.org/10.1080/03610918008812136
Abstract
This note investigates the advantage of using the least squares estimator as a starting point in Barrodale and Phillip's L -algorithmKeywords
This publication has 7 references indexed in Scilit:
- Using an approximate L1EstimatorCommunications in Statistics - Simulation and Computation, 1977
- Using the $L_2 $-Estimator in $L_1 $-EstimationSIAM Journal on Numerical Analysis, 1976
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]ACM Transactions on Mathematical Software, 1975
- An Improved Algorithm for Discrete $l_1 $ Linear ApproximationSIAM Journal on Numerical Analysis, 1973
- Two Linear Programming Algorithms for Unbiased Estimation of Linear ModelsJournal of the American Statistical Association, 1973
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete setNumerische Mathematik, 1966
- Linear Programming Techniques for Regression AnalysisJournal of the American Statistical Association, 1959