"Greedy" adaptive random-search method of conditional global extremum of functions

Mathematics. Physics. Mechanics


Аuthors

Ryazantseva O. V.

Abstract

Currently, the solution of problems of aerospace systems and space-rocket complexes are widely used metaheuristics global optimization methods. An example of this method is "greedy" adaptive algorithm for random search of global extremum, which is considered in this paper. Formed algorithmic and software method, whose effectiveness was demonstrated on model examples with the complex structure of level lines.

Keywords:

global extremum; metaheuristics methods; multistart; local search


Download

mai.ru — informational site MAI

Copyright © 2000-2021 by MAI

Вход