Capabilities of Constraint Programming in Safe Global Optimization

Abstract : We investigate the capabilities of constraints programming techniques in rigorous global optimization methods. We introduce different constraint programming techniques to reduce the gap between efficient but unsafe systems like Baron, and safe but slow global optimization approaches. We show how constraint programming filtering techniques can be used to implement optimality-based reduction in a safe and efficient way, and thus to take advantage of the known bounds of the objective function to reduce the domain of the variables, and to speed up the search of a global optimum. We describe an efficient strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equalities and inequalities to compute efficiently a promising upper bound. Experiments on the COCONUT benchmarks demonstrate that these different techniques drastically improve the performances.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00835183
Contributor : Alexandre Goldsztejn <>
Submitted on : Tuesday, June 18, 2013 - 11:01:04 AM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM

Identifiers

  • HAL Id : hal-00835183, version 1

Citation

Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher. Capabilities of Constraint Programming in Safe Global Optimization. Reliable Computing electronic edition, 2011, 15 (1), pp.47-59. ⟨hal-00835183⟩

Share

Metrics

Record views

161