Abstract
We shall consider again the Lipschitz global optimization problem on a finite n-interval [a, b]:
under the analytical conditions stated in Chapter 2.4; in particular, f is assumed to be Lipschitz-continuous with some constant L. As previously, the—not necessarily unique—optimal solution of this LGOP will be denoted by x* ∈ X*, and f* = f(x*). Additionally, the set of accumulation points generated by a PAS-type globally convergent adaptive partition algorithm will be denoted again by X a.
Keywords
- Global Optimization Problem
- Tail Index
- Implementation Aspect
- Extreme Order Statistic
- Lipschitz Global Optimization
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pintér, J.D. (1996). Estimation of Lipschitzian Problem Characteristics in Global Optimization. In: Global Optimization in Action. Nonconvex Optimization and Its Applications, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2502-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2502-5_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4751-2
Online ISBN: 978-1-4757-2502-5
eBook Packages: Springer Book Archive