References


R, Barton, J. S. Ivey, (1996),“Nelder Mead simplex modifications for simulation optimization”, Management Science 42(7): 954–973.

L. Han, M. Newmann, (2006),“Effect of dimensionality on the Nelder-Mead simplex method”, Optimization Methods and Software, 21(1): 1-16.

J.C. Lagarias, J.A. Reeds, M.H. Wright, P.E. Wright, (1998),“Convergence properties of the Nelder-Mead simplex method in low dimensions”, SIAM Journal on Optimization, 9(1): 112-147.

K.I.M. McKinnon, (1998), “Convergence of the Nelder-Mead simplex method to a nonstationary point”, SIAM Journal on Optimization, 9,  148-158.

J.A. Nelder, R. Mead, (1965), “A simplex method for function minimization”, Computer Journal 7: 308-313.

W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vettering, Numerical Recipes in C. Cambridge University Press, Cambridge, UK, 1988.

C.J. Price, I.D. Coope, D. Byatt, (2002), “A convergent variant of the Nelder-Mead algorithm”, Journal of Optimization Theory and Applications, 113: 5–19.

A.S. Rykov, (1983), "Simplex algorithms for unconstrained optimization”, Problems of Control and Information Theory, 12: 195-208.

P. Tseng, (2000), “Fortified-descent simplicial search method: a general approach” SIAM Journal on Optimization 10: 269–288.

W.C. Yu, (1979), “The convergence property of the simplex evolutionary techniques”, Scientia Sinica,Special issue of Mathematics 1: 68–77.