Homogeneous algorithms of multiextremal optimization for
Numerical methods and programming, Tome 12 (2011) no. 1, pp. 48-69
Voir la notice de l'article provenant de la source Math-Net.Ru
A number of ways to accelerate homogeneous algorithms for global optimization are
proposed. Theorems on the possibilities of acceleration without loss of convergence
to the global minimum are proved. Models of objective functions are considered.
It is proved that the use of these models ensures a convergence to the global minimum
of the objective function. A model to determine the application field of the algorithm
is constructed. Some numerical results of testing the proposed algorithm are discussed.
Keywords:
global optimization; multiextremal optimization; homogeneous algorithms; response surface models; models of objective functions.
@article{VMP_2011_12_1_a5,
author = {S. M. Elsakov and V. I. Shiryaev},
title = {Homogeneous algorithms of multiextremal optimization for},
journal = {Numerical methods and programming},
pages = {48--69},
publisher = {mathdoc},
volume = {12},
number = {1},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2011_12_1_a5/}
}
S. M. Elsakov; V. I. Shiryaev. Homogeneous algorithms of multiextremal optimization for. Numerical methods and programming, Tome 12 (2011) no. 1, pp. 48-69. http://geodesic.mathdoc.fr/item/VMP_2011_12_1_a5/