Paper Info
Title
BBOB-benchmarking the DIRECT global optimization algorithm
Abstract
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during the optimization. Furthermore, all the sampled points are considered when deciding where to sample next. The results suggest that the algorithm is a viable alternative only for low-dimensional search spaces (5D at most).
Year
DOI
Venue
2009
10.1145/1570256.1570323
GECCO (Companion)
Keywords
Field
DocType
direct global optimization algorithm,low-dimensional search space,space consuming,viable alternative,evolutionary computing,benchmarking,global optimization,evolutionary computation,search space
Derivative-free optimization,Mathematical optimization,Global optimization,Computer science,Meta-optimization,Evolutionary computation,Multi-swarm optimization,Artificial intelligence,Bees algorithm,Imperialist competitive algorithm,Machine learning,Metaheuristic
Conference
Citations 
PageRank 
References 
8
0.80
1
Authors
1
Name
Order
Citations
PageRank
Petr Pošík121015.44