Univariate box-constrained global optimization problems are considered, where the objective function is supposed to be Lipschitz continuous and multiextremal. It is assumed that its analytical representation is unknown (the function is given as a “black-box”) and even one its evaluation is a computationally expensive procedure. Geometric and information statistical frameworks for construction of global optimization algorithms are discussed. Several powerful acceleration techniques are described and a number of methods of both classes is constructed by mixing the introduced acceleration ideas. Numerical experiments executed on broad test classes taken from the literature show advantages of the presented techniques with respect to their direct competitors.
On acceleration of derivative-free univariate Lipschitz global optimization methods
Kvasov Dmitry
Writing – Review & Editing
;Mukhametzhanov MaratMembro del Collaboration Group
;Nasso Maria ChiaraWriting – Original Draft Preparation
;Sergeev YaroslavSupervision
2020-01-01
Abstract
Univariate box-constrained global optimization problems are considered, where the objective function is supposed to be Lipschitz continuous and multiextremal. It is assumed that its analytical representation is unknown (the function is given as a “black-box”) and even one its evaluation is a computationally expensive procedure. Geometric and information statistical frameworks for construction of global optimization algorithms are discussed. Several powerful acceleration techniques are described and a number of methods of both classes is constructed by mixing the introduced acceleration ideas. Numerical experiments executed on broad test classes taken from the literature show advantages of the presented techniques with respect to their direct competitors.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
