A rigorous global filtering algorithm for quadratic constraints

Constraints

Volumn 10, Issue 1, 2005, Pages 47-65

  Lebbah, Yahia ^a,b   Michel, Claude ^a   Rueher, Michel ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITY OF ORAN   (Algeria)

Author keywords

Global constraints; Quadratic constraints; Safe linearizations

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; LINEARIZATION; MATHEMATICAL MODELS; NONLINEAR SYSTEMS; RELAXATION PROCESSES;

GLOBAL CONSTRAINTS; QUADRATIC CONSTRAINTS; SAFE LINEARIZATION; SIMPLEX ALGORITHMS;

CONSTRAINT THEORY;

EID: 14644439840     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10601-004-5307-7     Document Type: Conference Paper

References (33)

1. Al-Khayyal, F. (1990). Jointly constrained biconvex programming and related problems: An overview. Comput. Math. Appl. 19: 53-62.
2. Al-Khayyal, F., & Falk, J. (1983). Jointly constrained biconvex programming. Math. Oper. Res. 8: 273-286.
3. Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). Branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Prog. 87(1): 131-152.
4. Bazarra, M., Sherali, H., & Shetty, C. (1993). Nonlinear Programming: Theory and Algorithms. John Wiley & Sons.
5. Bellido, A. (1992). Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems. Numer. Algorithms 6(3-4): 317-351.
6. Benhamou, F., McAllester, D., & Van-Hentenryck P. (1994). CLP (intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124-138.
7. COCONUT. (2002). A benchmark for global optimization and constraint satisfaction. Technical report, WWW-document (2002). http://www.mat.univie.ac. at/neum/glopt/coconut/benchmark.html.
8. Cox, D., Little, J., & O'Shea, D. (1997). Ideals, Varieties, and Algorithms. 2nd edition. New York: Springer-Verlag.
9. Davis, E. (1987). Constraint propagation with interval labels. J. Artif. Intell. 32: 281-331.
10. Didrit, O. (1997). Analyse par intervalles pour l'automatique: Résolution globale et garantie de problèmes non linéaires en robotique et en commande robuste. Ph.D. thesis, Université Parix XI Orsay.
11. Faltings, B. (1994). Arc consistency for continuous variables. J. Artif. Intell. 60(2): 363-376.
12. Granvilliers, L. (2004). RealPaver, Version 0.4, http://www.sciences. univernantes.fr/info/perso/permanents/granvil/realpaver/main.html.
13. Hansen, E. R. (1992). Global Optimization Using Interval Analysis. New York: Marcel Dekker.
14. Collavizza, H., Delobel, F., & Rueher, M. (1999). Comparing partial consistencies. Reliab. Comput. 5(3): 213-228.
15. IEEE-754. (1985). IEEE Standard for Binary Floating Point Arithmetic. ANSI/IEEE, New York, Std 754-1985 edition.
16. Ilog, ed. (2000a). ILOG CPLEX 7.0, Reference Manual. Ilog.
17. Ilog, ed. (2000b). ILOG Solver 5.0, Reference Manual. Ilog.
18. Jermann, C., Trombettoni, G., Neveu, B., & Rueher, M. (2000). A constraint programming approach for solving rigid geometric systems. In Proceedings of CP'00: Sixth International Conference on "Principles and Practice of Constraint Programming". Singapore, pages 233-248.
19. Kearfott, R. B. (1996). Rigorous Global Search: Continous Problems. Kluwer Academic Publishers Group.
20. Lebbah, Y. (1999). Contibution à la résolution de contraintes par consistance forte. Ph.D. thesis, Ecole des Mines de Nantes, France.
21. Lebbah, Y., & Lhomme, O. (2002). Accelerating filtering techniques for numeric CSPs'. Artif. Intill. 139(1): 109-132.
22. Lebba, Y., Michel, C., Rueher, M., Daney, D., & Merlet, J. (2005). Efficient and safe global constraints for handling numerical constraint system. SIAM journal of Numerical Analysis p. to appear.
23. Lebbah, Y., Rueher, M., & Michel, C. (2002). A global filtering algorithm for handling systems of quadratic equations and inequations. Proc. CP'2002, Lect. Notes Comput. Sci. 2470: 109-123.
24. Lhomme, O. (1993). Consistency techniques for numeric CSPs'. In Proceedings of IJCAI'93, pages 232-238.
25. Marti, P., & Rueher, M. (1995). A distributed cooperating constraints solving system. Int. J. Artif. Intell. Tools 4(1-2): 93-113.
26. McCormick, G. (1976). Computability of global solutions to factorable non-convex programs-Part I-Convex underestimating problems. Math. Prog. 10: 147-175.
27. Michel, C., Lebbah, Y., & Rueher, M. (2003). Safe embedding of the Simplex Algorithm in a CSP framework. In Proceedings of 5th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems CPAIOR 2003, CRT, Université de Montréal, pages 210-220.
28. Neumaier, A., & Shcherbina, O. (2004). Safe bounds in linear and mixed-integer programming. Math. Prog A. 99: 283-296.
29. Puget, J., & Van-Hentenryck, P. (1998). A constraints satisfaction approach to a circuit design problem. J. Glob. Optim. 13(1): 75-93.
30. Sherali, H., & Adams, W. (1999). A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishing.
31. Sherali, H., & Tuncbilek, C. (1992). A global oprtimization algorithm for polynomial using a reformulation-linearization technique. J. Glob. Optim. 7: 1-31.
32. Van-Hentenryck, P., Michel, L., & Deville, Y. (1997). Numerica: a Modelling Language for Global Optiization. MIT Press.
33. Wunderlings, R. (1996). Paralleler und Objektorientierter Simplex-Algorithmus (in German). Ph.D. thesis, Berlin.