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...

Celý popis

Podrobná bibliografia

Vydané v:	Information sciences Ročník 476; s. 64 - 82
Hlavní autori:	Tamura, Kenichi, Gallagher, Marcus
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!