All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Experimental Comparison of Six Population Based Algorithms for Continuous Black Box Optimization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00199147" target="_blank" >RIV/68407700:21230/12:00199147 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00083" target="_blank" >http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00083</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Experimental Comparison of Six Population Based Algorithms for Continuous Black Box Optimization

  • Original language description

    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, CauchyEDA, 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 ESreaches 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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP102%2F08%2FP094" target="_blank" >GP102/08/P094: Machine learning methods for solution construction in evolutionary algorithms</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2012

  • 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

  • Name of the periodical

    Evolutionary Computation

  • ISSN

    1063-6560

  • e-ISSN

  • Volume of the periodical

    20

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    26

  • Pages from-to

    483-508

  • UT code for WoS article

    000311334400002

  • EID of the result in the Scopus database