Skip to main content

1993 | OriginalPaper | Buchkapitel

The Cluster Problem in Global Optimization: the Univariate Case

verfasst von : B. Kearfott, K. Du

Erschienen in: Validation Numerics

Verlag: Springer Vienna

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The Cluster Problem in Global Optimization the Univariate Case. We consider a branch and bound method for enclosing all global minimizers of a nonlinearC2 or C1 objective function. In particular, we consider bounds obtained with interval arithmetic, along with the “midpoint test,” but no acceleration procedures. Unless the lower bound is exact, the algorithm without acceleration procedures in general gives an undesirable Cluster of intervals around each minimizer. In this article, we analyze this problem in the one dimensional case. Theoretical results are given which show that the problem is highly related to the behavior of the objective function near the global minimizers and to the order of the corresponding interval extension.

Metadaten
Titel
The Cluster Problem in Global Optimization: the Univariate Case
verfasst von
B. Kearfott
K. Du
Copyright-Jahr
1993
Verlag
Springer Vienna
DOI
https://doi.org/10.1007/978-3-7091-6918-6_10