Constraint Programming and Safe Global Optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Constraint Programming and Safe Global Optimization

Résumé

We investigate the capabilities of constraints programming techniques in rigor- ous global optimization methods. We introduce different constraint programming techniques to reduce the gap between efficient but unsafe systems like Baron1, and safe but slow global optimization approaches. We show how constraint program- ming 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 ob- jective 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.
Fichier principal
Vignette du fichier
rc09.pdf (95.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00510305 , version 1 (17-08-2010)

Identifiants

  • HAL Id : hal-00510305 , version 1

Citer

Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher. Constraint Programming and Safe Global Optimization. SCAN 2008, 3th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Verified Numerical Computations, Sep 2008, El Paso, TX, United States. ⟨hal-00510305⟩
408 Consultations
79 Téléchargements

Partager

Gmail Facebook X LinkedIn More