Many important design problems involve the search for the global extremum in the space of the system parameters. The functions to be optimized in many engineering applications are multi-extremal, behave as a black-box with unknown analytical representations, and are hard to evaluate. Therefore, it is necessary to use efficient methods of global finite-dimensional optimization for solving these challenging problems. In this paper, some of these methods developed by the authors in the framework of Lipschitz global optimization are briefly reviewed and compared with several widely-used nature-inspired algorithms
A numerical comparison of some deterministic and nature-inspired algorithms for black-box global optimization
KVASOV Dmitry
;Mukhametzhanov Marat;SERGEEV Yaroslav
2014-01-01
Abstract
Many important design problems involve the search for the global extremum in the space of the system parameters. The functions to be optimized in many engineering applications are multi-extremal, behave as a black-box with unknown analytical representations, and are hard to evaluate. Therefore, it is necessary to use efficient methods of global finite-dimensional optimization for solving these challenging problems. In this paper, some of these methods developed by the authors in the framework of Lipschitz global optimization are briefly reviewed and compared with several widely-used nature-inspired algorithmsFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.