ICOS: a branch and bound based solver for rigorous global optimization

References

• Al-Khayyal , F. and Falk , J. 1983 . Jointly constrained biconvex programming . Math. Oper. Res. , 8 ( 2 ) : 273 – 286 .
   Web of Science ®Google Scholar
• Audet , C. 1997 . “ Optimisation globale structurée : propriétés, équivalences et résolution ” . École Polytechnique de Montréal . Ph.D. thesis
   Google Scholar
• Benhamou , F. , McAllester , D. and Van-Hentenryck , P. Clp(intervals) revisited . Proceedings of the International Symposium on Logic Programming . Melbourne. pp. 124 – 138 . MIT Press .
   Google Scholar
• Collavizza , H. , Delobel , F. and Rueher , M. 1999 . Comparing partial consistencies . Reliab. Comput. , 5 ( 3 ) : 213 – 228 .
   Google Scholar
• Fourer , R. , Gay , D. and Kernighan , B. 2002 . AMPL: A Modeling Language for Mathematical Programming , Duxbury Press/Brooks/Cole Publishing Company .
   Google Scholar
• Frommer , A. and Lang , B. 2004 . “ Existence tests for solutions of nonlinear equations using Borsuk's theorem ” . MathePrisma : Department of Mathematics, Faculty of Mathematics and Natural Sciences, University of Wuppertal . Tech. Rep. BUW-SC 2004/2
   Google Scholar
• Goldsztejn , A. , Lebbah , Y. , Michel , C. and Rueher , M. 2008 . Revisiting the proof process in safe global optimization branch/bound algorithm . CP'08, Lecture Notes Comput. Sci. , 5202 : 598 – 602 .
   Google Scholar
• Hansen , E. R. 2004 . Global Optimization Using Interval Analysis , New York : Marcel Dekker .
   Google Scholar
• Horst , R. and Tuy , H. 1993 . Global Optimization: Deterministic Approaches , Springer-Verlag .
   Google Scholar
• Knüppel , O. PROFIL/BIAS – A fast interval library . Computing , 277 – 287 . Available at www.ti3.tu-harburg.de/Software/PROFIL/Profil.texinfo_1.html.
   Google Scholar
• Lebbah , Y. 1999 . “ Contribution à la résolution de contraintes par consistance forte ” . France : Université de Nantes . thesis
   Google Scholar
• Lebbah , Y. and Lhomme , O. Acceleration methods for numeric CSPs . Proceedings of AAAI'98 . pp. 19 – 24 . Madison, WI
   Google Scholar
• Lebbah , Y. and Lhomme , O. 2002 . Accelerating filtering techniques for numeric CSPs . Artificial Intelligence , 139 : 109 – 132 .
   Web of Science ®Google Scholar
• Lebbah , Y. , Michel , C. and Rueher , M. 2007 . An efficient and safe framework for solving optimization problems . J. Comput. Appl. Math. , 199 : 372 – 377 .
   Google Scholar
• Lebbah , Y. , Rueher , M. and Michel , C. 2002 . A global filtering algorithm for handling systems of quadratic equations and inequations . Lecture Notes Comput. Sci. , 2470 : 109 – 123 .
   Google Scholar
• Lebbah , Y. , Michel , C. , Rueher , M. , Daney , D. and Merlet , J.-P . 2004 . Efficient and safe global constraints for handling numerical constraint systems . SIAM J. Numeri. Anal. , 42 ( 5 ) : 2076 – 2097 .
   Google Scholar
• Lhomme , O. Consistency techniques for numeric CSPs . Proceedings of International Joint Conference on Artificial Intelligence . Chambéry, France. pp. 232 – 238 .
   Google Scholar
• Mackworth , A. 1977 . Consistency in networks of relations . J. Artificial Intelligence , 8 ( 1 ) : 99 – 118 .
   Web of Science ®Google Scholar
• McCormick , G. 1976 . Computability of global solutions to factorable nonconvex programs. Part I: Convex underestimating problems . Math. Program. , 10 : 147 – 175 .
   Web of Science ®Google Scholar
• Moore , R. 1966 . Interval Analysis , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Neumaier , A. 1990 . “ Interval Methods for Systems of Equations ” . In Encyclopedia of Mathematics and its Applications , 37 Cambridge, , UK : Cambridge University Press .
   Google Scholar
• Neumaier , A. 2004 . Complete search in continuous global optimization and constraint satisfaction . Acta Numerica , 3 : 271 – 369 .
   Google Scholar
• Neumaier , A. , Shcherbina , O. , Huyer , W. and Vinko , T. 2005 . A comparison of complete global optimization solvers . Math. Programming B. , 103 : 335 – 356 .
   Web of Science ®Google Scholar
• Rump , S. 2006 . “ Global optimization: a model problem ” . Hamburg University of Technology . Tech. Rep., Availabel at http://www.ti3.tu-harburg.de/rump/Research/ModelProblem.pdf
   Google Scholar
• Rump , S. and Sekigawa , H. 2008 . The ratio between the Toeplitz and the unstructured condition number to appear, Available at http://www.ti3.tu-harburg.de/paper/rump/RuSe06.pdf
   Google Scholar
• Sahinidis , N. V. and Tawarmalani , M. 2002 . “ Baron 5.0: Global optimisation of mixed-integer nonlinear programs ” . Department of Chemical and Biomolecular Engeneering, University of Illinois at Urbana-Champaign . Tech. Rep.
   Google Scholar
• Shcherbina , O. , Neumaier , A. , Sam-Haroud , D. , Vu , X.-H. and Nguyen , T.-V. 2002 . Benchmarking global optimization and constraint satisfaction codes . COCOS'02, Lecture Notes in Comput. Sci. , 2861 : 211 – 222 .
   Google Scholar
• Sherali , H. and Adams , W. 1999 . A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , Kluwer Academic Publishing .
   Google Scholar
• Sherali , H. and Tuncbilek , C. 1997 . New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems . Oper. Res. Lett. , 21 : 1 – 9 .
   Web of Science ®Google Scholar
• Stroustrup , B. 1991 . The C++ Programming Language , 2 , Addison-Wesley .
   Google Scholar
• Tawarmalani , M. and Sahinidis , N. V. 2002 . Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , Kluwer Academic Publishers Group .
   Google Scholar
• Van-Hentenryck , P. , McAllester , D. and Kapur , D. 1997 . Solving polynomial systems using branch and prune approach . SIAM J. Numeri. Anal. , 34 ( 2 ) : 797 – 827 .
   Google Scholar