IDA - Intelligent Data Analysis Research Group

BibTeX Entry

@inproceedings{PosikGECCO2009LineSearch,
  file = {p2329.pdf},
  category = {ida-publications},
  author = {Petr Po{\v s}{\'i}k},
  title = {BBOB-Benchmarking Two Variants of the Line-Search Algorithm},
  booktitle = {GECCO '09: Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference},
  year = {2009},
  publisher = {ACM},
  address = {New York, NY, USA},
  pages = {2329--2336},
  url = {http://dx.doi.org/10.1145/1570256.1570325},
  keywords = {2009, bbob, gecco, linesearch, optimization},
  abstract = {The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were tried and compared. The results are as expected: line search method can optimize only separable functions, for other functions it fails. The STEP method is slightly slower, however, is more robust in the multimodal case. The line search algorithms also identified 2 functions of the test suite (in addition to separable problems) which might be easy for algorithms exploiting separability.},
  vvvs = {1},
  obory = {JC,JD},
  zamer = {VZ BIO 2},
  projects = {MLSC},
}


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