A Simplex Method for Function Minimization
@article{Nelder1965ASM,
title={A Simplex Method for Function Minimization},
author={J. Nelder and R. Mead},
journal={Comput. J.},
year={1965},
volume={7},
pages={308-313}
}A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n 41) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point. [...] Key Method The method is shown to be effective and computationally compact. A procedure is given for the estimation of the Hessian matrix in the neighbourhood of the minimum, needed in statistical estimation problems.Expand
23,987 Citations
An improved simplex method for function minimization
- Computer Science
- 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929)
- 1996
- 17
A New Method of Constrained Optimization and a Comparison With Other Methods
- Computer Science
- Comput. J.
- 1965
- 1,209
Location of saddle points and minimum energy paths by a constrained simplex optimization procedure
- Chemistry
- 1979
- 286
Lattice Approximations to the Minima of Functions of Several Variables
- Mathematics, Computer Science
- JACM
- 1969
- 11
Numerical optimization and surface estimation with imprecise function evaluations
- Mathematics, Computer Science
- Stat. Comput.
- 2003
- 8
References
SHOWING 1-5 OF 5 REFERENCES
An Iterative Method for Finding Stationary Values of a Function of Several Variables
- Mathematics, Computer Science
- Comput. J.
- 1962
- 185
- PDF
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Mathematics
- 1962
- 1,230
An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Computer Science
- Comput. J.
- 1964
- 3,745
An Automatic Method for Finding the Greatest or Least Value of a Function
- Computer Science
- Comput. J.
- 1960
- 2,550
- PDF