Detail
Článek
Článek online
FT
Medvik - BMČ
  • Je něco špatně v tomto záznamu ?

Experimental comparison of six population-based algorithms for continuous black box optimization

P. Pošík, J. Kubalík,

. 2012 ; 20 (4) : 483-508.

Jazyk angličtina Země Spojené státy americké

Typ dokumentu srovnávací studie, časopisecké články, práce podpořená grantem

Perzistentní odkaz   https://www.medvik.cz/link/bmc13024406

Six population-based methods for real-valued black box optimization are thoroughly compared in this article. One of them, Nelder-Mead simplex search, is rather old, but still a popular technique of direct search. The remaining five (POEMS, G3PCX, Cauchy EDA, BIPOP-CMA-ES, and CMA-ES) are more recent and came from the evolutionary computation community. The recently proposed comparing continuous optimizers (COCO) methodology was adopted as the basis for the comparison. The results show that BIPOP-CMA-ES reaches the highest success rates and is often also quite fast. The results of the remaining algorithms are mixed, but Cauchy EDA and POEMS are usually slow.

Citace poskytuje Crossref.org

000      
00000naa a2200000 a 4500
001      
bmc13024406
003      
CZ-PrNML
005      
20130708112701.0
007      
ta
008      
130703s2012 xxu f 000 0|eng||
009      
AR
024    7_
$a 10.1162/EVCO_a_00083 $2 doi
035    __
$a (PubMed)22708972
040    __
$a ABA008 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxu
100    1_
$a Pošík, Petr $u Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic. posik@labe.felk.cvut.cz
245    10
$a Experimental comparison of six population-based algorithms for continuous black box optimization / $c P. Pošík, J. Kubalík,
520    9_
$a Six population-based methods for real-valued black box optimization are thoroughly compared in this article. One of them, Nelder-Mead simplex search, is rather old, but still a popular technique of direct search. The remaining five (POEMS, G3PCX, Cauchy EDA, BIPOP-CMA-ES, and CMA-ES) are more recent and came from the evolutionary computation community. The recently proposed comparing continuous optimizers (COCO) methodology was adopted as the basis for the comparison. The results show that BIPOP-CMA-ES reaches the highest success rates and is often also quite fast. The results of the remaining algorithms are mixed, but Cauchy EDA and POEMS are usually slow.
650    12
$a algoritmy $7 D000465
650    _2
$a benchmarking $x metody $7 D019985
650    _2
$a lidé $7 D006801
650    12
$a teoretické modely $7 D008962
650    _2
$a numerická analýza pomocí počítače $7 D009716
655    _2
$a srovnávací studie $7 D003160
655    _2
$a časopisecké články $7 D016428
655    _2
$a práce podpořená grantem $7 D013485
700    1_
$a Kubalík, Jiří $u -
773    0_
$w MED00007225 $t Evolutionary computation $x 1530-9304 $g Roč. 20, č. 4 (2012), s. 483-508
856    41
$u https://pubmed.ncbi.nlm.nih.gov/22708972 $y Pubmed
910    __
$a ABA008 $b sig $c sign $y a $z 0
990    __
$a 20130703 $b ABA008
991    __
$a 20130708113123 $b ABA008
999    __
$a ok $b bmc $g 988086 $s 822786
BAS    __
$a 3
BAS    __
$a PreBMC
BMC    __
$a 2012 $b 20 $c 4 $d 483-508 $i 1530-9304 $m Evolutionary computation $n Evol Comput $x MED00007225
LZP    __
$a Pubmed-20130703

Najít záznam

Citační ukazatele

Možnosti archivace