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.

MoreLess

Year of publication:	2007
Authors:	Stefanescu, Stefan
Published in:	Journal for Economic Forecasting. - Institutul de Prognoza Economica. - Vol. 4.2007, 4, p. 97-103
Publisher:	Institutul de Prognoza Economica
Subject:	global optimization \| Nelder-Mead algorithm \| multiple minima

More details

Type of publication:	Article
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C02 - Mathematical Methods
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005827593