A convergent variant of the Nelder-Mead algorithm

Journal of Optimization Theory and Applications

Volumn 113, Issue 1, 2002, Pages 5-19

  Price, C J ^a   Coope, I D ^a   Byatt, D ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

derivative free optimization; frame based methods; Nelder Mead algorithm; polytope; positive basis methods; simplex

Indexed keywords

DERIVATIVE-FREE OPTIMIZATION; FRAME BASED METHOD; FRAME-BASED; NELDER-MEAD ALGORITHMS; PARAMETERS ESTIMATION; PHYSICAL SCIENCE; POLYTOPES; POSITIVE BASE METHOD; SIMPLEX; UNCONSTRAINED OPTIMIZATION;

LINEAR PROGRAMMING;

EID: 0036251280     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014849028575     Document Type: Article

References (12)

1. NELDER, J. A., and MEAD, R., A Simplex Method for Function Minimization, Computer Journal, Vol. 7, pp. 308-313, 1965.
2. WRIGHT, M. H., Direct Search Methods: Once Scorned, Now Respectable, Numerical Analysis 1995, Edited by D. F. Griffiths and G. A. Watson, Pitman Research Notes in Mathematics, Addison-Wesley Longman, London, England, Vol. 344, 1996.
3. MCKINNON, K. I. M., Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point, SIAM Journal on Optimization, Vol. 9, pp 148-158, 1998.
4. LAGARIUS, J. C., REEDS, J. A., WRIGHT, M. H., and WRIGHT, P. E., Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions, SIAM Journal on Optimization, Vol. 9, pp. 112-147, 1998.
5. KELLEY, C. T., Detection and Remediation of Stagnation in the Nelder-Mead Algorithm Using a Sufficient Decrease Condition, SIAM Journal on Optimization, Vol. 10, pp. 43-55, 2000.
6. RYKOV, A. S., Simplex Algorithms for Unconstrained Minimization, Problems of Control and Information Theory, Vol. 12, pp. 195-208, 1983.
7. DENNIS, J. E., and TORCZON, V., Direct Search Methods on Parallel Machines, SIAM Journal on Optimization, Vol. 1, pp. 448-474, 1991.
8. COOPE, I. D., and PRICE, C. J., Frame Based Methods for Unconstrained Optimization, Journal of Optimization Theory and Applications, Vol. 107, pp 261-274, 2000.
9. DAVIS, C., Theory of Positive Linear Dependence, American Journal of Mathematics, Vol. 76, pp. 733-746, 1954.
10. COOPE, I. D., and PRICE, C. J., On the Convergence of Grid Based Methods for Unconstrained Minimization, SIAM Journal on Optimization, Vol. 11, pp. 859-69, 2001.
11. BYATT, D., Convergent Variants of the Nelder-Mead Algorithm, University of Canterbury, Christchurch, New Zealand, MSc Thesis, 2000.
12. MORÉ, J. J., GARBOW, B. S., and HILLSTROM, K. E., Testing Unconstrained Optimization Software, ACM Transactions on Mathematical Software, Vol. 7, pp. 17-41, 1981.