1965.,stationary point (Nelder and Mead -
Conn , A. R.,K.Scheinberg,L. N. Vicente., 2009.Introduction to Derivative Free Optimization,MPS-SIAM Series on Optimization 16 -
Coope , I. D. and C. J. Price, 2000.Frame Based Methods for Unconstrained Optimization,J. Optim. Theory Appl 107 261 -274
Coope , I. D. and C. J. Price, 2000a.A direct search conjugate directions algorithm for unconstrained minimization,ANZIAM J 42 478 -498
Coope , I. D. and C. J. Price, 2003.Positive bases in numerical optimization,Comput. Optim. Appl 21 169 -175
Davis , C., 1954.Theory of positive linear dependence,Am. J. Math 76 733 -746
Dennis , J. E.,D. J. Woods, 1987.Optimization on Micro-computers, The Nelder-Mead Simplex Algorithm, New Computing Environments: Microcomputers in Large-Scale Computing: SIAM, 122 -
Frimannslund , L. and T. Steihaug, 2007.A generating set search method using curvature information,Comput. Optim. Appl 38 105 -121
Gao , F., 2012.Implementing the NelderMead Simplex Algorithm with adaptive parameters,Comp. Optim. Appl 51 259 -277
Han , L, 2000., -
Jacoby , S. L. S.,J. S.Kowalik,J. T. Pizzo, 1972.Iterative Methods for Nonlinear Optimization Problems, -
Jorge , J. M.,B. S.Garbow,K. E. Hillstrom,, 1981.Testing Unconstrained Optimization Software,ACM T Math Software 7 17 -41
Kelley , C. T., 1999.Detection and Remediation of Stagnation in the Nelder-Mead Algorithm using a Sufficient Decrease Condition,SIAM J Optimiz 10 43 -55
Klein , K.,J. Neira, 2014.Nelder Mead Simplex Optimization Routine for Large-Scale Problems: A Distributed Memory Implementation,Comput Econ 43 447 -461
Lagarias , J. C.,J. A.Reads,M. H.Wright,P. E. Wright,, 1998.Convergence Properties of Nelder-Mead Simplex Algorithm in Low Dimension,SIAM J Optimiz 9 112 -147
Lagarias , J. C.,B.Poonen,M. H.Wright, 2012.Convergence of the restricted Nelder-Mead method in two dimensions,SIAM J Optimiz 22 501 -532
Lewis , R. M.,V.Torczon,M. W.Trosset, 2000.Direct search methods: then and Now,J Comput Appl Math 124 191 -207
Luangpaiboon , P., 2012.Varible Neighborhood Simplex search methods for Global Optimization models,J. Computer Sci 8 613 -620
Luersen , M.A.,R. LeRiche,F.Guyon, 2004.A constrained, globalized, and bounded NelderMead method,Struct Multidisc Optim 27 43 -54
McKinnon , K. I. M., 1998.Convergence of the NelderMead Simplex Method to a non-stationary point,SIAM J Optimiz 9 148 -158
Nelder , J. A.,R.Mead, 1965.A simplex method for function minimization,The COM JNL 7 308 -313
Parkinson , J. M.,D.Hutchinson, 1972.An investigation into the efficiency of variants on the simplex method,Numerical Methods for Non-linear Optimization 115 -135
Price , C. J.,I. D.Coope,D.Byatt, 2002.A Convergent Variant of the Nelder-Mead Algorith,J Optim Thoer Appl 113 5 -19
Price , C. J.,M.Reale,B. L.Robertson, 2006.A direct search method for smooth and nonsmooth unconstrained minimization,ANZIAM J. 48(CTAC 927 -948
Sanja , S. and S. Singer, 1999.Complexity Analysis of Nelder-Mead Search Iterations,Proceedings of the 1. Conference on Applied Mathematics and Computation Dubrovnik, Croatia, September 13-18 185 -196
Spendley , W.,G. R.Hext,F. R.Himsworth, 1962.Sequential Applications of simplex designs in optimization and evolutionary operation,TECHNO METRICS 4 441 -461
Torczon , V., 1989.Multi-Directional Search: A parallel Search Algorithm for Parallel Machines, -
Woods , D. J., 1985.An Interactive Approach for Solving Multi-Objective Optimization Problems,Technical Report 85-5 77251 -