Interval Branch and Bound Algorithms dealing with Black-Box Constraints - Université de Lorraine Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Interval Branch and Bound Algorithms dealing with Black-Box Constraints

Résumé

Interval Branch and Bound Algorithms have shown their intrinsic interest to solve exactly some difficult mixed non-convex and non-linear programs. A code named IBBA was developed to solve some design problems for electromechanical actuators. The idea of this paper is to extend the exact global optimization algorithm by inserting the direct use of an automatic numerical tool (based on a finite element method). This new methodology permit to solve more rationally design problems. Some numerical examples validate the interest of this new approach.
Fichier principal
Vignette du fichier
TOGO2010.pdf (108.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02944330 , version 1 (21-09-2020)

Identifiants

  • HAL Id : hal-02944330 , version 1

Citer

Julien Fontchastagner, Frédéric Messine. Interval Branch and Bound Algorithms dealing with Black-Box Constraints. TOULOUSE GLOBAL OPTIMIZATION WORKSHOP - TOGO 2010, Aug 2010, Toulouse, France. ⟨hal-02944330⟩
49 Consultations
70 Téléchargements

Partager

Gmail Facebook X LinkedIn More