Numerical optimization and surface estimation with imprecise function evaluations

Statistics and Computing

Volumn 13, Issue 3, 2003, Pages 277-286

  Joe, Harry ^a   Nash, John C ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Imprecise function evaluations; Nonlinear optimization; Response surface methodology

Indexed keywords

EID: 0346463263     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024226918553     Document Type: Article

References (33)

1. Börsch-Supan A. and Hajivassiliou V.A. 1993. Smooth unbiased multivariate probability simulators for maximum likelihood estimation of limited dependent variable models. J. Econometrics 58: 347-368.
2. Bortz D.M. and Kelley C.T. 1998. The simplex gradient and noisy optimization problems. In: Borggaard J.T., Burns J., Cliff E., and Schreck S. (Eds.), Computational Methods in Optimal Design and Control, volume 24 of Progress in Systems and Control Theory, Birkhäuser, Boston, 1998, pp. 77-90.
3. Box G.E.P. 1957. Evolutionary operation: A method for increasing industrial productivity. Applied Statistics 6: 81-101.
4. Box G.E.P and Draper N.R. 1987. Empirical Model-Building and Response Surfaces. Wiley, New York.
5. Carter R.G. 1991. On the global convergence of trust region algorithms using inexact gradient information. SIAM J. Numer. Anal. 28: 251-265.
6. Carter R.G. 1993. Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information. SIAM J. Sci. Comput. 14: 368-388.
7. Conn A.R., Gould N.I.M., and Toint P.L. 2000. Trust-Region Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA.
8. Davidon W.C. 1996. Conjugate directions in perspective. In: Adams L. and Nazareth J.L. (Eds.), Linear and Nonlinear Conjugate-Gradient Related Methods. SIAM, Philadelphia, pp. 79-82.
9. Dempster A.P., Laird N.M., and Rubin D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. B 39: 1-22.
10. Dennis J.E. and Torczon V. 1995. Managing approximation models in optimization, Rice University, Dept. of Computer Science TR95-19, available as http://www.cs.wm.edu/̃va/research/aiaa96.ps.gz
11. Elster C. and Neumaier A 1995. A grid algorithm for bound constrained optimization of noisy functions. IMA J. Numerical Analysis 15: 585-608.
12. Fligner M. and Verducci J.S. (Eds.) 1993. Probability Models and Statistical Analyses for Ranking Data. Lecture Notes in Statistics 80, Springer-Verlag, New York.
13. Gilmore P. and Kelley C.T. 1995. An implicit filtering algorithm for optimization of functions with many local minima. SIAM J. Opt. 4: 269-285.
14. Hooke R. and Jeeves T.A. 1961. 'Direct search' solution of numerical and statistical problems. J. Assoc. Computing Machinery 8: 212-229.
15. Joe H. 1995. Approximations to multivariate normal rectangle probabilities based on conditional expectations. J. Amer. Statist. Assoc. 90: 957-964.
16. Joe H. 1997. Multivariate Models and Dependence. Chapman & Hall, London.
17. Kelley C.T. 1999. Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease criterion. SIAM J. Optimization 10: 43-55.
18. Lagarias J.C., Reeds J.A., Wright M.H., and Wright P.E. 1998. Convergence properties of the Nelder-Mead simplex algorithm in low dimensions. SIAM J. Optimization 9: 112-147.
19. McCulloch C.E. 1994. Maximum likelihood variance components estimation for binary data. J. Amer. Statist. Assoc. 89: 330-335.
20. McCulloch C.E. 1997. Maximum likelihood algorithms for generalized linear mixed models. J. Amer. Statist. Assoc. 92: 162-170.
21. McFadden D. 1989. A method of simulated moments for estimation of discrete response models without numerical integration. Econometrica 57: 995-1026.
22. Mead R. and Pike D.J. 1975. A review of response surface methodology from a biometric viewpoint. Biometrics 31: 803-851.
23. Miller A. and Nguyen N.-K. 1994. Algorithm AS 295. A Fedorov exchange algorithm for D-optimal design. Appl. Statist. 43: 669-677.
24. Mockus J. 1989. Bayesian Approach to Global Optimization. Kluwer Academic Publishers, Dordrecht.
25. Nash J.C. 1990. Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation, 2nd edition. IOP Publications, Bristol.
26. Nash J. C. and Walker-Smith M. 1989. Nonlinear Parameter Estimation: Examples and Software Extensions, published in conjunction with Nonlinear Parameter Estimation: An Integrated System in BASIC (1987). Nash Information Services Inc., Ottawa.
27. Neider J.A. and Mead R. 1965. A simplex method for function minimization. Computer Journal 7: 308-313.
28. Powell M.J.D. 1994. A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Gomez S. and Hennart J.-P. (Eds.), Advances in Optimization and Numerical Analysis. Kluwer, Amsterdam.
29. Powell M.J.D. 2002. UOBYQA: Unconstrained optimization by quadratic approximation. Math. Program., Ser. B 92: 555-582.
30. Schall R. 1991. Estimation in generalized linear models with random effects. Biometrika 78: 719-727.
31. Spendley W., Hext G.R., and Himsworth F.R. 1962. Sequential application of simplex designs in optimisation and evolutionary operation. Technometrics 4: 441-461.
32. Torczon V. 1997. On the convergence of pattern search methods. SIAM J. Optimization 7: 1-25.
33. Tseng P. 1999. Fortified-descent simplicial search method: A general approach. SIAM J. Optimization 10(1): 269-288.