Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. The cluster problem in constrained global optimization

The cluster problem in constrained global optimization

Thumbnail Image
Download
Name

10898_2017_531_ReferencePDF.pdf

Size

1.34 MB

Format

Adobe PDF

Checksum (MD5)

8729e1fd7d331f6b0905ffd3b7babe7d

Download all files submitted through automated deposit
art_3679089460433080442.zip (867.81 KB)
Author(s)
Barton, Paul I
•
Kannan, Rohit
Date Issued
May 2017
Journal
Journal of Global Optimization
Publisher
Springer-Verlag
Citation
Kannan, Rohit, and Paul I. Barton. “The Cluster Problem in Constrained Global Optimization.” Journal of Global Optimization 69, no. 3 (May 11, 2017): 629–676.
Version
Author's final manuscript
Abstract
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 cluster problem in unconstrained global optimization (Du and Kearfott 1994; Wechsung et al. in J Glob Optim 58(3):429–438, 2014) to the constrained setting based on a recently-developed notion of convergence order for convex relaxation-based lower bounding schemes. It is shown that clustering can occur both on nearly-optimal and nearly-feasible regions in the vicinity of a global minimizer. In contrast to the case of unconstrained optimization, where at least second-order convergent schemes of relaxations are required to mitigate the cluster problem when the minimizer sits at a point of differentiability of the objective function, it is shown that first-order convergent lower bounding schemes for constrained problems may mitigate the cluster problem under certain conditions. Additionally, conditions under which second-order convergent lower bounding schemes are sufficient to mitigate the cluster problem around a global minimizer are developed. Conditions on the convergence order prefactor that are sufficient to altogether eliminate the cluster problem are also provided. This analysis reduces to previous analyses of the cluster problem for unconstrained optimization under suitable assumptions.
MIT Department
Massachusetts Institute of Technology. Department of Chemical Engineering
Massachusetts Institute of Technology. Process Systems Engineering Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/116181
DOI of Published Version
https://doi.org/10.1007/s10898-017-0531-z
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.