Structure of Filled Functions: Why Gaussian and Cauchy Templates Are Most Efficient

One of the main problems of optimization algorithms is that they often end up in a local optimum. It is, therefore, necessary to make sure that the algorithm gets out of the local optimum and eventually reaches the global optimum. One of the promising ways guiding one from the local optimum is promp...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International Journal of Combinatorial Optimization Problems and Informatics 2016-09, Vol.7 (3), p.87
Hauptverfasser:	Kalashnikov, Vyacheslav, Kreinovich, Vladik, Flores-Muñiz, José Guadalupe, Kalashnykova, Nataliya
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!