Interval Branch and Bound Algorithms dealing with Black-Box Constraints - Archive ouverte HAL Access content directly
Conference Papers Year :

Interval Branch and Bound Algorithms dealing with Black-Box Constraints

(1) , (2)
1
2

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-02944330 , version 1

Cite

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⟩
33 View
57 Download

Share

Gmail Facebook Twitter LinkedIn More