Lipschitz global optimization appears in many practical problems: decision making, optimal control, stability problems, finding the minimal root problems, etc. In many engineering applications the objective function is a “black-box”, multiextremal, non-differentiable and hard to evaluate. Another common property of the function to be optimized very often is the Lipschitz condition. In this talk, the Lipschitz global optimization problem is considered and several nature-inspired and Lipschitz global optimization algorithms are briefly described and compared with respect to the number of evaluations of the objective function.
Skip Nav Destination
Research Article| June 08 2016
One-dimensional global search: Nature-inspired vs. Lipschitz methods
Dmitri E. Kvasov;
AIP Conf. Proc. 1738, 400012 (2016)
Dmitri E. Kvasov, Marat S. Mukhametzhanov; One-dimensional global search: Nature-inspired vs. Lipschitz methods. AIP Conf. Proc. 8 June 2016; 1738 (1): 400012. https://doi.org/10.1063/1.4952200
Download citation file: