The method approximates a local optimum of a problem with n variables when the objective function varies smoothly and is unimodal.
Nelder-Mead in n dimensions maintains a set of n+1 test points arranged as a simplex.