On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales

Abstract

The necessity to find the global optimum of multiextremal functions arises in many applied problems where finding local solutions is insufficient. One of the desirable properties of global optimization methods is \emph{strong homogeneity} meaning that a method produces the same sequences of points where the objective function is evaluated independently both of multiplication of the function by a scaling constant and of adding a shifting constant. In this paper, several aspects of global optimization using strongly homogeneous methods are considered. First, it is shown that even if a method possesses this property theoretically, numerically very small and large scaling constants can lead to ill-conditioning of the scaled problem. Second, a new class of global optimization problems where the objective function can have not only finite but also infinite or infinitesimal Lipschitz constants is introduced. Third, the strong homogeneity of several Lipschitz global optimization algorithms is studied in the framework of the Infinity Computing paradigm allowing one to work \emph{numerically} with a variety of infinities and infinitesimals. Fourth, it is proved that a class of efficient univariate methods enjoys this property for finite, infinite and infinitesimal scaling and shifting constants. Finally, it is shown that in certain cases the usage of numerical infinities and infinitesimals can avoid ill-conditioning produced by scaling. Numerical experiments illustrating theoretical results are described.

25 pages, 3 figures

Cited by in corpus (6)

• Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
• Safe global optimization of expensive noisy black-box functions in the $\delta$-Lipschitz framework
• Some paradoxes of Infinity revisited
• On the use of the Infinity Computer architecture to set up a dynamic precision floating-point arithmetic
• High dimensional Bayesian Optimization Algorithm for Complex System in Time Series
• Conjugate-symplecticity properties of Euler--Maclaurin methods and their implementation on the Infinity Computer