IDA - Intelligent Data Analysis Research Group

BibTeX Entry

@article{Posik2012LocAlgs,
  category = {ida-publications},
  author = {Petr Po{\v s}{\'i}k and Waltraud Huyer},
  title = {Restarted Local Search Algorithms for Continuous Black Box Optimization},
  journal = {Evolutionary Computation},
  volume = {20},
  number = {4},
  year = {2012},
  language = {english},
  publisher = {MIT Press},
  issn = {1063-6560},
  pages = {575-607},
  url = {http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00087},
  keywords = {optimization, local search, black-box, continuous domain},
  abstract = {Several local search algorithms for real-valued domains (axis parallel line search, Nelder-Mead simplex search, Rosenbrock's algorithm, quasi-Newton method, NEWUOA, and VXQR) are described and thoroughly compared in this article, embedding them in a multi-start method. Their comparison aims (1) to help the researchers from the evolutionary community to choose the right opponent for their algorithm (to choose an opponent that would constitute a hard-to-beat baseline algorithm), (2) to describe individual features of these algorithms and show how they influence the algorithm on different problems, and (3) to provide inspiration for the hybridization of evolutionary algorithms with these local optimizers. The recently proposed Comparing Continuous Optimizers (COCO) methodology was adopted as the basis for the comparison. The results show that in low dimensional spaces, the old method of Nelder and Mead is still the most successful among those compared, while in spaces of higher dimensions, it is better to choose an algorithm based on quadratic modeling, such as NEWUOA or a quasi-Newton method.},
  vvvs = {1},
  obory = {JC,JD},
  projects = {MLSC},
}


Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.