Abstract
This paper introduces a new filtering algorithm for handling systems of quadratic equations and inequations. Such constraints are widely used to model distance relations in numerous application areas ranging from robotics to chemistry. Classical filtering algorithms are based upon local consistencies and thus, are unable to achieve a significant pruning of the domains of the variables occurring in quadratic constraints systems. The drawback of these approaches comes from the fact that the constraints are handled independently. We introduce here a global filtering algorithm that works on a tight linear relaxation of the quadratic constraints. First experimentations show that this new algorithm yields a much more effective pruning of the domains than local consistency filtering algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. A. Al-Khayyal. Jointly constrained biconvex programming and related problems: An overview. Computers and Mathematics with Applications, pages Vol. 19, No. 11, 53–62, 1990.
F. A. Al-Khayyal and J. E. Falk. Jointly constrained biconvex programming. Mathematics of Operations Research, pages Vol. 8, No. 2, 273–286, 1983.
G. Alefeld and J. Hezberger, editors. Introduction to Interval Computations. Academic press, 1983.
C. Audet, P. Hansen, B. Jaumard, and G. Savard. Branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming, pages 87(1), 131–152, 2000.
O. P. Babichev, A. B. and Kadyrova, T. P. Kashevarova, A. S. Leshchenko, and Semenov A. L. Unicalc, a novel approach to solving systems of algebraic equations. Interval Computations 1993(2), pages 29–47, 1993.
M. S. Bazaraa, H. D. Sherali, and C. M. Shetty. Nonlinear Programming: Theory and Algorithms. John Wiley & Sons, 1993.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124–138, 1994.
F. Benhamou and W. Older. Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming, pages 32(1):1–24, 1997.
A. Colmerauer. Spécifications de prolog iv. Technical report, GIA, Faculté des Sciences de Luminy, 163, Avenue de Luminy 13288 Marseille cedex 9 (France), 1994.
E. Davis. Constraint propagation with interval labels. Journal of Artificial Intelligence, pages 32:281–331, 1987.
O. Didrit. Analyse par intervalles pour l’automatique: résolution globale et garantie de problémes non linéaires en robotique et en commande robuste. PhD thesis, Université Parix XI Orsay, 1997.
M. Rueher H. Collavizza, F. Delobel. Comparing partial consistencies. Reliable Computing, pages Vol. 5(3), 213–228, 1999.
Ilog, editor. ILOG Solver 4.0, Reference Manual. Ilog, 1997.
Y. Lebbah. Contribution á la résolution de contraintes par consistance forte. PhD thesis, Ecole des Mines de Nantes, France, 1999.
Y. Lebbah and O. Lhomme. Accelerating filtering techniques for numeric csps. Journal of Artificial Intelligence, page Forthcoming, 2002.
O. Lhomme. Consistency techniques for numeric csps. In Proceedings of IJCAI’93, pages 232–238, 1993.
R. Moore. Interval Analysis. Prentice Hall, 1966.
A. P. Morgan. Computing all solutions to polynomial systems using homotopy continuation. Appl. Math. Comput., pages 24:115–138, 1987.
A. Neumaier. Introduction to Numerical Analysis. Cambridge Univ. Press, Cambridge, 2001.
W. J. Older and A. Velino. Extending prolog with constraint arithmetic on real intervals. In Proc. of IEEE Canadian conference on Electrical and Computer Engineering, pages 14.1.1–14.1.4. IEEE Computer Society Press, 1990.
H. D. Sherali and W. P. Adams. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishing, 1999.
H. D. Sherali and C. H. Tuncbilek. A global optimization algorithm for polynomial using a reformulation-linearization technique. Journal of Global Optimization, pages 7, 1–31, 1992.
P. Van-Hentenryck, D. Mc Allester, and D. Kapur. Solving polynomial systems using branch and prune approach. SIAM Journal on Numerical Analysis, pages 34(2):797–827, 1997.
P. Van-Hentenryck, L. Michel, and Y. Deville. Numerica: a Modeling Languge for Global Optimization. MIT press, 1997.
R. Wunderlings. Paralleler und Objektorientierter Simplex-Algorithmus (in German). PhD thesis, Berlin, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lebbah, Y., Rueher, M., Michel, C. (2002). A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive