Acceleration tools for diagonal information global optimization algorithms

In this paper we face a classical global optimization problem-minimization of a multiextremal multidimensional Lipschitz function over a hyperinterval . We introduce two new diagonal global optimization algorithms unifying the power of the following three approaches: efficient univariate information global optimization methods, diagonal approach for generalizing univariate algorithms to the multidimensional case, and local tuning on the behaviour of the objective function (estimates of the local Lipschitz constants over different subregions) during the global search. Global convergence conditio ns of a new type are established for the diagonal information methods. The new algorithms demonstrate quite satisfactory performance in comparison wit h the diagonal methods using only global information about the Lipschitz co nstant.