Lipschitz Global Optimization
- 1 January 2011
- book chapter
- Published by Wiley
Abstract
In this paper, a global optimization problem is considered where the objective function and constraints are multiextremal black-box functions satisfying the Lipschitz condition over a hyperinterval and hard to evaluate. Such functions are frequently encountered in practice and that explains the great interest of researchers in the stated problem. Some known approaches to solving this problem are briefly described.Keywords
This publication has 145 references indexed in Scilit:
- Lipschitz and Hölder global optimization using space-filling curvesApplied Numerical Mathematics, 2010
- Global optimization in the 21st century: Advances and challengesComputers & Chemical Engineering, 2005
- An algorithm for solving global optimization problems with nonlinear constraintsJournal of Global Optimization, 1995
- ?BB: A global optimization method for general constrained nonconvex problemsJournal of Global Optimization, 1995
- On the selection of subdivision directions in interval branch-and-bound methods for global optimizationJournal of Global Optimization, 1995
- Accelerations for global optimization covering methods using second derivativesJournal of Global Optimization, 1994
- Global minimum potential energy conformations of small moleculesJournal of Global Optimization, 1994
- Customizing methods for global optimization-a geometric viewpointJournal of Global Optimization, 1993
- A wide class of test functions for global optimizationJournal of Global Optimization, 1993
- Multidimensional bisection: The performance and the contextJournal of Global Optimization, 1993