A deterministic global optimization using smooth diagonal auxiliary functions

Abstract

In many practical decision-making problems it happens that functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. In this paper, a global optimization problem is considered where both the goal function~$f(x)$ and its gradient $f^{\prime }(x)$ are black-box functions. It is supposed that $f^{\prime }(x)$ satisfies the Lipschitz condition over the search hyperinterval with an unknown Lipschitz constant~$K$. A new deterministic `Divide-the-Best' algorithm based on efficient diagonal partitions and smooth auxiliary functions is proposed in its basic version, its convergence conditions are studied and numerical experiments executed on eight hundred test functions are presented.

25 pages, 7 figures, 3 tables

References in corpus (2)

• Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme

Cited by in corpus (4)

• Best practices for comparing optimization algorithms
• Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants
• An Efficient Global Optimization Algorithm with Adaptive Estimates of the Local Lipschitz Constants
• High dimensional Bayesian Optimization Algorithm for Complex System in Time Series