IBEX

IBEX is a C++ library for constraint processing over real numbers. It provides reliable algorithms for handling non-linear constraints. In particular, roundoff errors are also taken into account. It is based on interval arithmetic and affine arithmetic. The main feature of Ibex is its ability to build strategies declaratively through the contractor programming paradigm. It can also be used as a black-box solver. Two emblematic problems that can be addressed are: System solving. A guaranteed enclosure for each solution of a system of (nonlinear) equations is calculated. Global optimization. A global minimizer of some function under non-linear constraints is calculated with guaranteed bounds on the objective minimum. IBEX is an open-source academic project that started in 2007.


References in zbMATH (referenced in 12 articles , 1 standard article )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Marendet, Antoine; Goldsztejn, Alexandre; Chabert, Gilles; Jermann, Christophe: A standard branch-and-bound approach for nonlinear semi-infinite problems (2020)
  2. Goldsztejn, Alexandre; Chabert, Gilles: Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation (2019)
  3. Joudrier, Hugo; Thiard, Florence: A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014 (2018)
  4. Neveu, Bertrand; Trombettoni, Gilles; Araya, Ignacio: Node selection strategies in interval branch and bound algorithms (2016)
  5. Ninin, Jordan: Global optimization based on contractor programming: an overview of the IBEX library (2016)
  6. Vismara, Philippe; Coletta, Remi; Trombettoni, Gilles: Constrained global optimization for wine blending (2016)
  7. Neveu, Bertrand; Trombettoni, Gilles; Araya, Ignacio: Adaptive constructive interval disjunction: algorithms and experiments (2015)
  8. Goualard, Frédéric: How do you compute the midpoint of an interval? (2014)
  9. Maïga, Moussa; Ramdani, Nacim; Travé-Massuyès, Louise; Combastel, Christophe: A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability (2014)
  10. Araya, Ignacio; Neveu, Bertrand; Trombettoni, Gilles: An interval extension based on occurrence grouping (2012)
  11. Neveu, Bertrand; Trombettoni, Gilles; Chabert, Gilles: Improving inter-block backtracking with interval Newton (2010)
  12. Chabert, Gilles; Jaulin, Luc: Contractor programming (2009)