Applying Nelder Mead’s Optimization Algorithm for Multiple Global Minima

The iterative deterministic optimization method could not more find multiple global minima of a given objective function ( [6] ). 
Generally, the probabilistic optimization algorithms have not this restrictive behaviour, to determine only a single global minimum point. In this context we’ll prove experimentally that Nelder-Mead’s heuristic procedure can detect successfully multiple global extremal points.

Keywords: global optimization, Nelder-Mead algorithm, multiple minima
JEL Classification: C61, C02