The Nelder-Mead Simplex Procedure for Function Minimization
Donald M. Olsson, Lloyd S. Nelson · Technometrics · 1975
The Nelder-Mead simplex method for function minimization is a “direct” method requiring no derivatives. The objective function is evaluated at the vertices of a simplex, and movement is away from the poorest value. The process is adaptive, causing the simplexes to be continually revised to best conform to the nature of the response surface. The generality of the method is illust'rated by using it. to solve six problems appearing in the May 1973 issue of Technometrics.
Cited by 460 works. doi:10.1080/00401706.1975.10489269
Authors
References
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Algorithm AS 47: Function Minimization Using a Simplex Procedure
- The Estimation of Parameters in Nonlinear, Implicit Models
- TABLES OF PERCENTAGE POINTS OF THE INVERTED BETA (F) DISTRIBUTION
- Elimination of Linear Parameters in Nonlinear Regression
- High-speed Computers as a Supplement to Graphical Methods. III. Twist Matrix Methods for Minimizing the Error-square Sum in Problems with Many Unknown Constants.
- Response Surface Techniques for Dual Response Systems
- A Sequential Simplex Program for Solving Minimization Problems
- Least Squares Estimation for a Class of Non-Linear Models