%0 Conference Paper %1 10.1145/3583133.3596396 %A Dietrich, Konstantin %A Kerschke, Pascal %B Proceedings of the Companion Conference on Genetic and Evolutionary Computation %C New York, NY, USA %D 2023 %I Association for Computing Machinery %K topic_engineering BBOB, SBOX-COST, benchmarking continuous nevergrad, optimization, %P 2326–2329 %R 10.1145/3583133.3596396 %T Evaluation of Algorithms from the Nevergrad Toolbox on the Strictly Box-Constrained SBOX-COST Benchmarking Suite %U https://doi.org/10.1145/3583133.3596396 %X In this paper we report the benchmarking results of four algorithms on the Strict Box-Constraint Optimization Studies (SBOX-COST) benchmarking suite which, as the name states, employs strict box constraints. These results are compared to the benchmarking results on the Black-box Optimization Benchmarking (BBOB) suite which serves as basis for the SBOX-COST suite, but is less restrivtive with respect to box constraints. SBOX-COST enforces its box constraints by returning an invalid value (∞) whenever a point outside of the bounds is evaluated. We use the following four algorithms from the Nevergrad Toolbox: Estimation of Multivariate Normal Algorithm (EMNA), Differential Evolution (DE), Constrained Optimization BY Linear Approximation (Cobyla) and Particle Swarm Optimization (PSO). All algorithms are employed without parameter tuning. Generally, all algorithms perform quite similiar on both suites but we notice a slight advantage for the algorithms that are allowed to evaluate the functions outside of the bounds. The effect of the advantage varies very much with function ID and in some cases, an algorithm's performance on a problem from the SBOX-COST suite is even better than on the corresponding problem from the BBOB suite. %@ 9798400701207

@inproceedings{10.1145/3583133.3596396, abstract = {In this paper we report the benchmarking results of four algorithms on the Strict Box-Constraint Optimization Studies (SBOX-COST) benchmarking suite which, as the name states, employs strict box constraints. These results are compared to the benchmarking results on the Black-box Optimization Benchmarking (BBOB) suite which serves as basis for the SBOX-COST suite, but is less restrivtive with respect to box constraints. SBOX-COST enforces its box constraints by returning an invalid value (∞) whenever a point outside of the bounds is evaluated. We use the following four algorithms from the Nevergrad Toolbox: Estimation of Multivariate Normal Algorithm (EMNA), Differential Evolution (DE), Constrained Optimization BY Linear Approximation (Cobyla) and Particle Swarm Optimization (PSO). All algorithms are employed without parameter tuning. Generally, all algorithms perform quite similiar on both suites but we notice a slight advantage for the algorithms that are allowed to evaluate the functions outside of the bounds. The effect of the advantage varies very much with function ID and in some cases, an algorithm's performance on a problem from the SBOX-COST suite is even better than on the corresponding problem from the BBOB suite.}, added-at = {2024-10-02T10:38:17.000+0200}, address = {New York, NY, USA}, author = {Dietrich, Konstantin and Kerschke, Pascal}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2353566b36a8c2978e6188d093507acaf/scadsfct}, booktitle = {Proceedings of the Companion Conference on Genetic and Evolutionary Computation}, doi = {10.1145/3583133.3596396}, interhash = {2200999dde5f322f9292ba07aaa81812}, intrahash = {353566b36a8c2978e6188d093507acaf}, isbn = {9798400701207}, keywords = {topic_engineering BBOB, SBOX-COST, benchmarking continuous nevergrad, optimization,}, location = {Lisbon, Portugal}, numpages = {4}, pages = {2326–2329}, publisher = {Association for Computing Machinery}, series = {GECCO '23 Companion}, timestamp = {2024-11-28T17:41:02.000+0100}, title = {Evaluation of Algorithms from the Nevergrad Toolbox on the Strictly Box-Constrained SBOX-COST Benchmarking Suite}, url = {https://doi.org/10.1145/3583133.3596396}, year = 2023 }