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 metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.univ-lorraine.fr/hal-02944330
Contributor : Julien Fontchastagner <>
Submitted on : Monday, September 21, 2020 - 1:45:47 PM
Last modification on : Tuesday, September 22, 2020 - 3:34:57 AM

File

TOGO2010.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02944330, version 1

Citation

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⟩

Share

Metrics

Record views

10

Files downloads

10