Advertisement

Global Optimization Based on Contractor Programming: An Overview of the IBEX Library

  • Jordan NininEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9582)

Abstract

IBEX is an open-source 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 or with an AMPL interface. Two emblematic problems that can be addressed are: (i) System solving: A guaranteed enclosure for each solution of a system of (nonlinear) equations is calculated; (ii) Global optimization: A global minimizer of some function under non-linear constraints is calculated with guaranteed and reliable bounds on the objective minimum.

Keywords

Constraint Programming Interval Arithmetic Contractor Program Tuning Phase Affine Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    IBEX: a C++ numerical library based on interval arithmetic and constraint programming. http://www.ibex-lib.org
  2. 2.
    IEEE SA - 1788–2015 - IEEE Standard for Interval ArithmeticGoogle Scholar
  3. 3.
    Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval Taylor. In: Beldiceanu, N., Jussien, N., Pinson, É. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 1–16. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  4. 4.
    Benhamou, F., Granvilliers, L.: Continuous and interval constraints. Handb. Constraint Program. 2, 571–603 (2006)CrossRefGoogle Scholar
  5. 5.
    Bessiere, C., Debruyne, R.: Theoretical analysis of singleton arc consistency. In: Proceedings of ECAI-04 workshop on Modeling and Solving Problems with Constraints (2004)Google Scholar
  6. 6.
    Carbonnel, C., Trombettoni, G., Vismara, P., Chabert, G.: Q-intersection algorithms for constraint-based robust parameter estimation. In AAAI’14-Twenty-Eighth Conference on Artificial Intelligence, pp. 26–30 (2014)Google Scholar
  7. 7.
    Chabert, G., Jaulin, L.: Contractor programming. Artif. Intell. 173(11), 1079–1100 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Collavizza, H., Delobel, F., Rueher, M.: A note on partial consistencies over continuous domains. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 147–161. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Goualard, F.: Gaol: NOT Just Another Interval Library. University of Nantes, France (2005)Google Scholar
  10. 10.
    Knuppel, O.: PROFIL/BIAS-a fast interval library. Computing 53(3–4), 277–287 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Lhomme, O.: Consistency techniques for numeric CSPs. In: IJCAI, vol. 93, pp. 232–238. Citeseer (1993)Google Scholar
  12. 12.
    Nehmeier, M., von Gudenberg, J.W.: FILIB++, expression templates, the coming interval standard. Reliable Comput. 15(4), 312–320 (2011)MathSciNetGoogle Scholar
  13. 13.
    Ninin, J.: Optimisation Globale basée sur l’Analyse d’Intervalles: Relaxation Affine et Limitation de la Mémoire. Ph.D. thesis, Institut National Polytechnique de Toulouse, Toulouse (2010)Google Scholar
  14. 14.
    Ninin, J., Chabert, G.: Global optimization based on contractor programming. In: XII GLOBAL OPTIMIZATION WORKSHOP, pp. 77–80 (2014)Google Scholar
  15. 15.
    Ninin, J., Messine, F., Hansen, P.: A reliable affine relaxation method for global optimization. 4OR 13(3), 247–277 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Stolfi, J., de Figueiredo, L.: Self-validated numerical methods and applications. In: Monograph for 21st Brazilian Mathematics Colloquium (1997)Google Scholar
  17. 17.
    Stolfi, J., de Figueiredo, L.H.: Self-validated numerical methods and applications. In: Monograph for 21st Brazilian Mathematics Colloquium. IMPA/CNPq, Rio de Janeiro, Brazil (1997)Google Scholar
  18. 18.
    Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Bessière, Christian (ed.) CP 2007. LNCS, vol. 4741, pp. 635–650. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Lab-STICC, IHSEV TeamENSTA-BretagneBrestFrance

Personalised recommendations