Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints

Abstract

In deterministic constrained global optimization, upper bounding the objective function generally resorts to local minimization at the nodes of the branch and bound. The local minimization process is sometimes costly when constraints must be respected. We propose in this paper an alternative approach when the constraints are inequalities or relaxed equalities so that the feasible space has a non-null volume. First, we extract an inner region, i.e., an (entirely feasible) convex polyhedron or box in which all points satisfy the constraints. Second, we select a point inside the extracted inner region and update the upper bound with its cost. We use two inner region extraction algorithms implemented in our interval B&B called IbexOpt [7]. This upper bounding shows good performance in medium-sized systems proposed in the COCONUT suite.
Fichier principal
Vignette du fichier
inhc4_gow_2012-1.pdf (238.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00733860 , version 1 (19-09-2012)

Identifiers

  • HAL Id : hal-00733860 , version 1

Cite

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu, Gilles Chabert. Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints. GOW'12, Jun 2012, Natal, Brazil. pp.25-29. ⟨hal-00733860⟩
698 View
439 Download

Share

Gmail Facebook X LinkedIn More