Black-Box Optimization Benchmarking of Prototype Optimization with Evolved Improvement Steps for Noiseless Function Testbed
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00156839" target="_blank" >RIV/68407700:21230/09:00156839 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Black-Box Optimization Benchmarking of Prototype Optimization with Evolved Improvement Steps for Noiseless Function Testbed
Original language description
This paper presents benchmarking of a stochastic local search algorithm called Prototype Optimization with Evolved Improvement Steps (POEMS) on the noise-free BBOB 2009 testbed. Experiments for 2, 3, 5, 10 and 20 D were done, where D denotes the search space dimension. The maximum number of function evaluations is chosen as Dx105. Experimental results show that POEMS performs best on all separable functions and the attractive sector function. It works also quite well on multi-modal functions with lowerdimensions. On the other hand, the algorithm fails to solve functions with high conditioning.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Genetic and Evolutionary Computation Conference 2009
ISBN
978-1-60558-325-9
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
ACM
Place of publication
New York
Event location
Montreal
Event date
Jul 8, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—