Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints - École des Ponts ParisTech Access content directly
Journal Articles Journal of Global Optimization Year : 2014

Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints

Abstract

In deterministic continuous constrained global optimization, upper bounding the objective function generally resorts to local minimization at several nodes/iterations of the branch and bound. We propose in this paper an alternative approach when the constraints are inequalities and 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 describe in this paper two original inner region extraction algorithms implemented in our interval B&B called IbexOpt. They apply to nonconvex constraints involving mathematical operators like +,x,power,sqrt,exp,log,sin. This upper bounding shows very good performance obtained on medium-sized systems proposed in the COCONUT suite.
Fichier principal
Vignette du fichier
innerregions_jogo_2014.pdf (530.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01061701 , version 1 (08-09-2014)

Identifiers

Cite

Ignacio Araya, Gilles Trombettoni, Bertrand Neveu, Gilles Chabert. Upper Bounding in Inner Regions for Global Optimization under Inequality Constraints. Journal of Global Optimization, 2014, 60 (2), pp.145-164. ⟨10.1007/s10898-014-0145-7⟩. ⟨hal-01061701⟩
745 View
1024 Download

Altmetric

Share

Gmail Facebook X LinkedIn More