Multidimensional unconstrained global optimization problem with objective function under Lipschitz condition is considered. For solving this problem the dimensionality reduction approach on the base of the nested optimization scheme is used. This scheme reduces initial multidimensional problem to a family of one-dimensional subproblems being Lipschitzian as well and thus allows applying univariate methods for the execution of multidimensional optimization. For two well-known one-dimensional methods of Lipschitz optimization the modifications providing the acceleration of the search process in the situation when the objective function is continuously differentiable in a vicinity of the global minimum are considered and compared. Results of computational experiments on conventional test class of multiextremal functions confirm efficiency of the modified methods.
Skip Nav Destination
Research Article| June 08 2016
Global search acceleration in the nested optimization scheme
Vladimir A. Grishagin;
AIP Conf. Proc. 1738, 400010 (2016)
Vladimir A. Grishagin, Ruslan A. Israfilov; Global search acceleration in the nested optimization scheme. AIP Conf. Proc. 8 June 2016; 1738 (1): 400010. https://doi.org/10.1063/1.4952198
Download citation file: