Direct search algorithms for optimization calculations

Acta Numerica

Volumn 7, Issue , 1998, Pages 287-336

  Powell, M J D ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85011436515     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492900002841     Document Type: Article

References (27)

1. Brent R. P. (1973), Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, NJ.
2. Brodlie K. W. (1975), ‘A new direction set method for unconstrained minimization without evaluating derivatives’, J. Inst. Math. Appl. 15, 385–396.
3. Conn A. R., Scheinberg K. and Toint P. L. (1997a), ‘On the convergence of derivative free methods for unconstrained optimization’, in Approximation Theory and Optimization (Buhmann M. D. and Iserles A., eds), Cambridge University Press, Cambridge, pp. 83–108.
4. Conn A. R., Scheinberg K. and Toint P. L. (1997b), ‘Recent progress in unconstrained nonlinear optimization without derivatives’, Math. Prog. 79, 397–414.
5. Dennis J. E. and Torczon V. (1991), ‘Direct search methods on parallel machines’, SIAM J. Optim. 1, 448–474.
6. Elster C. and Neumaier A. (1995), ‘A grid algorithm for bound constrained optimization of noisy functions’, IMA J. Numer. Anal. 15, 585–608.
7. Fletcher R. (1987), Practical Methods of Optimization, Wiley, Chichester.
8. Gill P. E., Murray W. and Wright M. H. (1981), Practical Optimization, Academic Press, London.
9. Goldberg D. E. (1989), Genetic Algorithms in Search, Optimizationand Machine Learning, Addison-Wesley, Reading, MA.
10. Grippo L., Lampariello F. and Lucidi S. (1988), ‘Global convergence and stabilization of unconstrained minimization methods without derivatives’, J. Optim. Theory Appl. 56, 385–406.
11. Hooke R. and Jeeves T. A. (1961), ‘Direct search solution of numerical and statistical problems’, J. Assoc. Comput. Mach. 8, 212–229.
12. Kelley C. T. (1997), ‘Detection and remediation of stagnation in the Nelder–Mead algorithm using a sufficient decrease condition’, North Carolina State University Report CRSC-TR97-2.
13. van Laarhoven P. J. M. and Aarts E. H. L. (1987), Simulated Annealing: Theory and Applications, Reidel, Dordrecht.
14. Lucidi S. and Sciandrone M. (1997), ‘On the global convergence of derivative free methods for unconstrained optimization’, preprint, Università di Roma ‘La Sapienza’, Italy.
15. McKinnon K. I. M. (1997), ‘Convergence of the Nelder–Mead simplex method to a nonstationary point’, preprint (to be published in SIAM J. Optim.).
16. Nelder J. A. and Mead R. (1965), ‘A simplex method for function minimization’, Comput. J. 7, 308–313.
17. Powell M. J. D. (1964), ‘An efficient method for finding the minimum of a function of several variables without calculating derivatives’, Comput. J. 7, 155–162.
18. Powell M. J. D. (1973), ‘On search directions for minimization algorithms’, Math. Prog. 4, 193–201.
19. Powell M. J. D. (1994), ‘A direct search optimization method that models the objective and constraint functions by linear interpolation’, in Advances in Optimization and Numerical Analysis (Gomez S. and Hennart J-P., eds), Kluwer Academic, Dordrecht, pp. 51–67.
20. Press W. H., Flannery B. P., Teukolsky S. A. and Vetterling W. T. (1986), Numerical Recipes: The Art of Scientific Computation, Cambridge University Press, Cambridge.
21. Rosenbrock H. H. (1960), ‘An automatic method for finding the greatest or least value of a function’, Comput. J. 3, 175–184.
22. Smith C. S., (1962), ‘The automatic computation of maximum likelihood estimates’, N.C.B. Sci. Dept. Report SC 846/MR/40.
23. Spendley W., Hext G. R. and Himsworth F. R. (1962), ‘Sequential application of simplex designs in optimisation and evolutionary operation’, Technometrics 4, 441–461.
24. Toint Ph. L. and Callier F. M. (1977), ‘On the accelerating property of an algorithm for function minimization without calculating derivatives’, J. Optim. Theory Appl. 23, 531–547.
25. Torczon V. (1997), ‘On the convergence of pattern search algorithms’, SIAM J. Optim. 7, 1–25.
26. Winfield D. (1973), ‘Function minimization by interpolation in a data table’, J. Inst. Math. Appl. 12, 339–347.
27. Wright M. H. (1996), ‘Direct search methods: once scorned, now respectable’, in Numerical Analysis 1995 (Griffiths D. F. and Watson G. A., eds), Addison Wesley Longman, Harlow, pp. 191–208.