The tunneling algorithm for the global minimization of functions.

*(English)*Zbl 0601.65050Authors’ summary: This paper considers the problem of finding the global minima of a function f(x): \(\Omega\subset R^ n\to R\). For this purpose we present an algorithm composed of a sequence of cycles, each cycle consisting of two phases: (a) a minimization phase having the purpose of lowering the current function value until a local minimizer is found and, (b) a tunneling phase that has the purpose of finding a point \(x\in \Omega\), other than the last minimizer found, such that when employed as starting point for the next minimization phase, the new stationary point will have a function value no greater than the previous minimum found.

In order to test the algorithm, several numerical examples are presented. The functions considered are such that the number of relative minima varies between a few and several thousand; in all cases, the algorithm presented here was able to find the global minimizer(s). When compared with alternate procedures, the results show that the new algorithm converges more often to the global minimizer(s) than its competitors, additionally, it becomes more efficient than the other procedures for problems with increasing density of relative minima.

In order to test the algorithm, several numerical examples are presented. The functions considered are such that the number of relative minima varies between a few and several thousand; in all cases, the algorithm presented here was able to find the global minimizer(s). When compared with alternate procedures, the results show that the new algorithm converges more often to the global minimizer(s) than its competitors, additionally, it becomes more efficient than the other procedures for problems with increasing density of relative minima.

Reviewer: J.Abaffy