Paper Info
Title
BBOB-benchmarking two variants of the line-search algorithm
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.
Year
DOI
Venue
2009
10.1145/1570256.1570325
GECCO (Companion)
Keywords
Field
DocType
separable function,step method,multimodal case,line search method,different univariate search algorithm,coordinate-wise search,test suite,line-search algorithm,line search,step,evolutionary computation,benchmarking,brent s method,search algorithm,evolutionary computing
Incremental heuristic search,Search algorithm,Computer science,Beam stack search,Line search,Artificial intelligence,Binary search algorithm,Mathematical optimization,Evolutionary computation,Beam search,Algorithm,Best-first search,Machine learning
Conference
Citations 
PageRank 
References 
4
0.62
2
Authors
1
Name
Order
Citations
PageRank
Petr Pošík121015.44