Published in Romanian Journal of Economic Forecasting,
Full text available online16 February 2008
| Requires a PDF viewer such as Xpdf
The iterative deterministic optimization method could not more find multiple global minima of a given objective function (  ).
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.
global optimization, Nelder-Mead algorithm, multiple minima
JEL Classification: C61, C02