arXiv Analytics

Sign in

arXiv:1709.08242 [math.OC]AbstractReferencesReviewsResources

Best practices for comparing optimization algorithms

Vahid Beiranvand, Warren Hare, Yves Lucet

Published 2017-09-24Version 1

Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we systematically review the benchmarking process of optimization algorithms, and discuss the challenges of fair comparison. We provide suggestions for each step of the comparison process and highlight the pitfalls to avoid when evaluating the performance of optimization algorithms. We also discuss various methods of reporting the benchmarking results. Finally, some suggestions for future research are presented to improve the current benchmarking process.

Related articles: Most relevant | Search more
arXiv:2410.08331 [math.OC] (Published 2024-10-10)
Fejér* monotonicity in optimization algorithms
arXiv:2104.04974 [math.OC] (Published 2021-04-11)
Alternating cyclic extrapolation methods for optimization algorithms
arXiv:1912.01514 [math.OC] (Published 2019-12-03)
Cross-benchmarking for performance evaluation: looking across best practices of different peer groups using DEA