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: | Barton, Paul I (Contributor), Kannan, Rohit (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Chemical Engineering (Contributor), Massachusetts Institute of Technology. Process Systems Engineering Laboratory (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2018-06-08T19:17:14Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The cluster problem in constrained global optimization
by: Barton, Paul I, et al.
Published: (2018) -
Convergence-order analysis of branch-and-bound algorithms for constrained problems
by: Barton, Paul I, et al.
Published: (2018) -
Complete Solutions to General Box-Constrained Global Optimization Problems
by: Dan Wu, et al.
Published: (2011-01-01) -
Master-Slave TLBO Algorithm for Constrained Global Optimization Problems
by: Sandeep Mane, et al.
Published: (2021-04-01) -
Clustering-Based Monarch Butterfly Optimization for Constrained Optimization
by: Sibo Huang, et al.
Published: (2020-09-01)