Sciweavers

Share
GECCO
2009
Springer

BBOB-benchmarking two variants of the line-search algorithm

10 years 7 months ago
BBOB-benchmarking two variants of the line-search algorithm
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. Categories and Subject Descriptors
Petr Posik
Added 24 Jul 2010
Updated 24 Jul 2010
Type Conference
Year 2009
Where GECCO
Authors Petr Posik
Comments (0)
books