Univariate geometric lipschitz global optimization algorithms

36Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

In this survey, univariate global optimization problems are considered where the objective function or its first derivative can be multiextremal black-box costly functions satisfying the Lipschitz condition over an interval. Such problems are frequently encountered in practice. A number of geometric methods based on constructing auxiliary functions with the usage of different estimates of the Lipschitz constants are described in the paper.

Cite

CITATION STYLE

APA

Kvasov, D. E., & Sergeyev, Y. D. (2012). Univariate geometric lipschitz global optimization algorithms. Numerical Algebra, Control and Optimization, 2(1), 69–90. https://doi.org/10.3934/naco.2012.2.69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free