S. Mokhtar, H. D. Bazaraa, C. M. Sherali, and . Shetty, Nonlinear Programming : Theory and Algorithms, 1993.

S. L. Campbell, C. D. Jr, and . Meyer, Generalized Inverses of Linear Transformations, 1991.
DOI : 10.1137/1.9780898719048

J. Cruz and P. Barahona, Global Hull Consistency with Local Search for Continuous Constraint Solving, EPIA '01: Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving, pp.349-362, 2001.
DOI : 10.1007/3-540-45329-6_34

A. Frommer and B. Lang, Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem, SIAM Journal on Numerical Analysis, vol.43, issue.3, 2004.
DOI : 10.1137/S0036142903438148

A. Goldsztejn, Y. Lebbah, C. Michel, and M. Rueher, Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm, CP2008, 14th International Conference on Principles and Practice of Constraint Programming, pp.598-602, 2008.
DOI : 10.1007/978-3-540-85958-1_49

URL : https://hal.archives-ouvertes.fr/hal-00297086

R. Baker and . Kearfott, Validated probing with linear relaxations. interval .louisiana, 2005.

R. Baker and . Kearfott, Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization . journal of Optimization Methods and Software, pp.715-731, 2006.

Y. Lebbah, Icos: a branch and bound based solver for rigorous global optimization. Optimization Methods and Software, pp.709-726, 2009.

Y. Lebbah and O. Lhomme, Accelerating filtering techniques for numeric CSPs, Artificial Intelligence, vol.139, issue.1, pp.109-132, 2002.
DOI : 10.1016/S0004-3702(02)00194-7

Y. Lebbah, C. Michel, and M. Rueher, Using constraint techniques for a safe and fast implementation of optimality-based reduction, Proceedings of the 2007 ACM symposium on Applied computing , SAC '07, pp.326-331, 2007.
DOI : 10.1145/1244002.1244079

Y. Lebbah, C. Michel, M. Rueher, D. Daney, and J. Merlet, Efficient and Safe Global Constraints for Handling Numerical Constraint Systems, SIAM Journal on Numerical Analysis, vol.42, issue.5, pp.2076-2097, 2004.
DOI : 10.1137/S0036142903436174

URL : https://hal.archives-ouvertes.fr/hal-00907765

Y. Lebbah, M. Rueher, and C. Michel, A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations, CP2002, 8th International Conference on Principles and Practice of Constraint Programming, pp.109-123, 2002.
DOI : 10.1007/3-540-46135-3_8

O. Lhomme, Consistency techniques for numeric CSPs, Proceedings of IJCAI'93, pp.232-238, 1993.

A. Neumaier, Complete search in continuous global optimization and constraint satisfaction, Acta Numerica, 2004.

A. Neumaier and O. Shcherbina, Safe bounds in linear and mixedinteger programming, Mathematical Programming, pp.283-296, 2004.

A. Neumaier, O. Shcherbina, W. Huyer, and T. Vinkó, A comparison of complete global optimization solvers, Mathematical Programming, vol.99, issue.2, pp.335-356, 2005.
DOI : 10.1007/s10107-005-0585-4

M. Rueher, A. Goldsztejn, Y. Lebbah, and C. Michel, Constraint programming and safe global optimization, International Symposium on Nonlinear Theory and its Applications, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00510305

S. Hong, N. V. Ryoo, and . Sahinidis, A branch-and-reduce approach to global optimization, Journal of Global Optimization, pp.107-138, 1996.

P. Van-hentenryck, D. Mc-allester, and D. Kapur, Solving Polynomial Systems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis, vol.34, issue.2, pp.34797-827, 1997.
DOI : 10.1137/S0036142995281504