Quantitative measure of nonconvexity for black-box continuous functions

Metaheuristic algorithms usually aim to solve nonconvex optimization problems in black-box and high-dimensional scenarios. Characterizing and understanding the properties of nonconvex problems is therefore important for effectively analyzing metaheuristic algorithms and their development, improvemen...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information sciences Jg. 476; S. 64 - 82
Hauptverfasser:	Tamura, Kenichi, Gallagher, Marcus
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.02.2019
Schlagworte:	Black-box functions Complexity Fitness landscape analysis Large problems Metaheuristics Monte Carlo integral Monte Carlo integral Black-box functions Metaheuristics Large problems Fitness landscape analysis Complexity
ISSN:	0020-0255, 1872-6291
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!