Global optimization of multivariable functions satisfying the Vanderbei condition
Abstract
We propose two algorithms for solving global optimization problems on a hyperrectangle with an objective function satisfying the Vanderbei condition (this function is also called an -Lipschitz continuous function). The algorithms belong to the class of non-uniform cover-ings methods. For the algorithms we prove propositions about convergence to an -solution in terms of the objective function. We illustrate the performance of the algorithms using several test numerical examples with non-Lipschitz continuous objective functions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.