On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
arXiv:1108.1042 · doi:10.1016/j.amc.2011.07.051
Abstract
The implementation of global optimization algorithms, using the arithmetic of infinity, is considered. A relatively simple version of implementation is proposed for the algorithms that possess the introduced property of strong homogeneity. It is shown that the P-algorithm and the one-step Bayesian algorithm are strongly homogeneous.
11 pages, 1 figure
Cited by in corpus (8)
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- Some paradoxes of Infinity revisited
- The Olympic Medals Ranks, lexicographic ordering and numerical infinities
- Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically
- On existence of infinite primes and infinite twin primes
- Single-tape and Multi-tape Turing machines through the lens of the Grossone methodology
- Using blinking fractals for mathematical modeling of processes of growth in biological systems