A Sequential Simplex Program for Solving Minimization Problems

Nelder and Mead [2] have developed a simple, robust direct-search procedure for finding the minimum of a function. It consists of evaluating a function of n variables at the (n + 1) vertices of a general simplex. The simplex is then moved away from the largest function value by replacing the vertex ... View More