Influence of Lipschitz bounds on the speed of global optimization

    Remigijus Paulavičius Affiliation
    ; Julius Žilinskas Affiliation


Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed sphere. The efficiency of a branch and bound algorithm with proposed bound and combinations of bounds is evaluated experimentally while solving a number of multidimensional test problems for global optimization. The influence of different bounds on the performance of a branch and bound algorithm has been investigated.

Keyword : global optimization, Lipschitz optimization, Lipschitz bounds, branch and bound algorithm

How to Cite
Paulavičius, R., & Žilinskas, J. (2012). Influence of Lipschitz bounds on the speed of global optimization. Technological and Economic Development of Economy, 18(1), 54-66.
Published in Issue
Apr 10, 2012
Abstract Views
PDF Downloads
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.