Optimization on Microcomputers. The Nelder-Mead Simplex Algorithm
Dennis, J.E. Jr.
Woods, Daniel J.
In this paper we describe the Nelder-Mead simplex method for obtaining the minimizer of a function. The Nelder-Mead algorithm has several properties that make it a natural choice for implementation and utilization on microcomputers. Stopping criteria for the method are presented as well as a brief discussion of the convergence properties of the method. An algorithmic statement of the method is included as an appendix.
Citable link to this pagehttps://hdl.handle.net/1911/101586
MetadataShow full item record
- CAAM Technical Reports