The best parameter subset using the Chebychev curve fitting criterion-Reference-Cited by-同舟云学术

The best parameter subset using the Chebychev curve fitting criterion

Published:1983-09 Issue:1 Volume:27 Page:64-74
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Armstrong Ronald D.,Beck Philip O.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02591964.pdf

Reference16 articles.

1. G. Appa and C. Smith, “OnL 1 and Chebychev estimation”,Mathematical Programming 5 (1973) 73–87.

2. R.D. Armstrong, E.L. Frome and M.G. Sklar, “Linear programming in exploratory data analysis”,Journal of Educational Statistics 5 (1980) 293–307.

3. R.D. Armstrong and D.S. Kung, “Min-max estimates for a linear multiple regression problem”,Applied Statistics 28 (1979) 93–100.

4. R.D. Armstrong and D.S. Kung, “A dual method for discrete Chebychev curve fitting”,Mathematical programming 19 (1980) 186–199.

5. R.D. Armstrong and M.T. Kung, “An algorithm to select the best subset for a least absolute value regression problem”, to appear in Optimization in Statistics Volume, TIMS Studies of the Management Sciences.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameter estimation of linear systems with input-output noisy data: A generalized lp norm approach;Signal Processing;1994-06

2. The best subset of parameters in min-max linear regression;Communications in Statistics - Simulation and Computation;1986

3. A Branch and Bound Procedure for Selection of Variables in Minimax Regression;SIAM Journal on Scientific and Statistical Computing;1985-07