Implementing the Nelder-Mead simplex algorithm with adaptive parameters

Computational Optimization and Applications

Volumn 51, Issue 1, 2012, Pages 259-277

  Gao, Fuchang ^a   Han, Lixing ^b  

^a UNIVERSITY OF IDAHO   (United States)

^b UNIVERSITY OF MICHIGAN FLINT   (United States)

Author keywords

Adaptive parameter; Nelder Mead method; Optimization; Polytope; Simplex

Indexed keywords

ADAPTIVE PARAMETERS; EXPANSION AND CONTRACTION; HIGH DIMENSIONS; HIGH-DIMENSIONAL PROBLEMS; NELDER-MEAD ALGORITHMS; NELDER-MEAD METHODS; NELDER-MEAD SIMPLEX; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; POLYTOPES; SIMPLEX; UNIFORMLY CONVEXES;

ALGORITHMS; OPTIMIZATION;

NUMERICAL METHODS;

EID: 84857190907     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-010-9329-3     Document Type: Article

References (21)

1. Andrei, N.: Convex functions. Adv. Model. Optim. 9(2), 257-267 (2007)
2. Byatt, D.: Convergent variants of the Nelder-Mead algorithm. Master's Thesis, University of Canterbury, Christchurch, New Zealand (2000)
3. Byrd, R., Nocedal, J., Zhu, C.: Towards a discrete Newton method with memory for large-scale optimization. In: Di Pillo, G., Giannessi, F. (eds.) Nonlinear Optimization and Applications. Plenum, New York (1996)
4. Dennis, J.E. Jr., Torczon, V.: Direct search methods on parallel machines. SIAM J. Optim. 1, 448-474 (1991)
5. Dennis, J.E. Jr., Woods, D.J.: Optimization on microcomputers: The Nelder-Mead simplex algorithm. In: Wouk, A. (ed.) New Computing Environments: Microcomputers in Large-Scale Scientific Computing. SIAM, Philadelphia (1987)
6. Han, L., Neumann, M.: Effect of dimensionality on the Nelder-Mead simplex method. Optim. Methods Softw. 21(1), 1-16 (2006) (Pubitemid 43019114)
7. Kelley, C.T.: Iterative Methods for Optimization. SIAM Publications, Philadelphia (1999)
8. Kelley, C.T.: Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition. SIAM J. Optim. 10, 43-55 (2000)
9. Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385-482 (2003)
10. Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.: Convergence properties of the Nelder-Mead simplex algorithm in low dimensions. SIAM J. Optim. 9, 112-147 (1998)
11. Math Works: MATLAB 6, Release 12, The Math Works, Natick, MA (2000)
12. Mckinnon, K.I.M.: Convergence of the Nelder-Mead simplex method to a nonstationary point. SIAM J. Optim. 9, 148-158 (1998)
13. Moré, J.J., Garbow, B.S., Hillstrom, B.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17-41 (1981)
14. Nelder, JA., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308-313 (1965)
15. Price, C.J., Coope, I.D., Byatt, D.: A convergent variant of the Nelder-Mead algorithm. JOTA 113, 5-19 (2002) (Pubitemid 39583361)
16. Torczon, V.: Multi-directional Search: A Direct Search Algorithm for Parallel Machines. Ph.D. Thesis, Rice University, TX (1989)
17. Tseng, P.: Fortified-descent simplicial search method: a general approach. SIAM J. Optim. 10, 269-288(2000)
18. Woods, D.J.: An Iterative Approach for Solving Multi-objective Optimization Problems. Ph.D. Thesis, Rice University, TX (1985)
19. Wright, M.H.: Direct search methods: Once scorned, now respectable. In: Griffiths, D.F., Watson, GA. (eds.) Numerical Analysis 1995: Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis, pp. 191-208. Addison Wesley Longman, Harlow (1996)
20. Wright, M.H.: N&M@42: Nelder-Mead at 42", a talk given at University of Waterloo, June 2007
21. Zalinescu, C: On uniformly convex functions. J. Math. Anal. Appl. 95, 344-374 (1983)