The cluster problem in constrained global optimization
Deterministic branch-and-bound algorithms for continuous global optimization often visit a large number of boxes in the neighborhood of a global minimizer, resulting in the so-called cluster problem (Du and Kearfott in J Glob Optim 5(3):253-265, 1994). This article extends previous analyses of the c...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2018-06-08T19:17:14Z.
|
| Subjects: | |
| Online Access: | Get fulltext |