Are metaheuristics worth it? A computational comparison between nature-inspired and deterministic techniques on black-box optimization problems

12/13/2022
by   Jakub Kúdela, et al.
0

In the field of derivative-free optimization, both of its main branches, the deterministic and nature-inspired techniques, experienced in recent years substantial advancement. In this paper, we provide an extensive computational comparison of selected methods from each of these branches. The chosen representatives were either standard and well-utilized methods, or the best-performing methods from recent numerical comparisons. The computational comparison was performed on five different benchmark sets and the results were analyzed in terms of performance, time complexity, and convergence properties of the selected methods. The results showed that, when dealing with situations where the objective function evaluations are relatively cheap, the nature-inspired methods have a significantly better performance than their deterministic counterparts. However, in situations when the function evaluations are costly or otherwise prohibited, the deterministic methods might provide more consistent and overall better results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2022

An extensive numerical benchmark study of deterministic vs. stochastic derivative-free global optimization algorithms

Research in derivative-free global optimization is under active developm...
research
07/08/2015

An optimal randomized incremental gradient method

In this paper, we consider a class of finite-sum convex optimization pro...
research
09/11/2012

Query Complexity of Derivative-Free Optimization

This paper provides lower bounds on the convergence rate of Derivative F...
research
06/24/2022

Black Box Optimization Using QUBO and the Cross Entropy Method

Black box optimization (BBO) can be used to optimize functions whose ana...
research
08/06/2021

Topology Optimization Methods for 3D Structural Problems: A Comparative Study

The work provides an exhaustive comparison of some representative famili...
research
02/15/2004

Computational complexity and simulation of rare events of Ising spin glasses

We discuss the computational complexity of random 2D Ising spin glasses,...

Please sign up or login with your details

Forgot password? Click here to reset