Skip to Main content Skip to Navigation
Conference papers

Interval Branch and Bound Algorithms dealing with Black-Box Constraints

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Julien Fontchastagner Connect in order to contact the contributor
Submitted on : Monday, September 21, 2020 - 1:45:47 PM
Last modification on : Tuesday, October 19, 2021 - 2:24:21 PM
Long-term archiving on: : Friday, December 4, 2020 - 6:00:17 PM


Files produced by the author(s)


  • HAL Id : hal-02944330, version 1


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⟩



Record views


Files downloads