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

Full description

Bibliographic Details

Published in:	Information sciences Vol. 476; pp. 64 - 82
Main Authors:	Tamura, Kenichi, Gallagher, Marcus
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!