Abstract
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after suitable preprocessing to arbitrary algebraic constraints. The basic new techniques consist in eliminating bilinear entries from a quadratic constraint, and solving the resulting separable quadratic constraints by means of a sequence of univariate quadratic problems. Care is taken to ensure that all methods correctly account for rounding errors in the computations. Various tests and examples illustrate the advantage of the presented method.
Similar content being viewed by others
References
Anderson, E. D., & Anderson, K. D. (1995). PresGolving in linear programming. Mathematical Programming, 71, 221–245.
Apt, K. R. (1999). The essence of constraint propagation. Theoretical Computer Science, 221(1), 179–210.
Babichev, A. B., Kadyrova, O. B., Kashevarova, T. P., Leshchenko, A. S., & Semenov, A. L. (1993). UniCalc, a novel approach to solving systems of algebraic equations. Interval Computations, 3, 29–47.
Benhamou, F. (1996). Heterogeneous constraint solving. In M. Hanus & M. Rodríguez-Artalejo (Eds.), Proceedings of ALP’96, 5th international conference on algebraic and logic programming. Lecture notes in computer science (Vol. 1139, pp. 62–76). Aachen: Springer.
Benhamou, F., Goualard, F., Granvilliers, L., & Puget, J. F. (1999). Revising hull and box consistency. In International conference on logic programming (pp. 230–244). citeseer.ist.psu.edu/benhamou99revising.html.
Benhamou, F., Granvilliers, L., & Goualard, F. (1999). Interval constraints: Results and perspectives. In New Trends in constraints (pp. 1–16). citeseer.ist.psu.edu/benhamou99interval.html.
Benhamou, F., McAllister, D., & Van Hentenryck, P. (1994). CLP(intervals) revisited. In Proc. international symposium on logic programming (pp. 124–138). Cambridge: MIT.
Benhamou, F., & Older, W. J. (1997). Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming, 32, 1–24.
Bliek, C., Spelucci, P., Vicente, L. N., Neumaier, A., Granvilliers, L., Monfro, E., et al. (2000). Algorithms for solving nonlinear constrained and optimization problems: The state of the art. http://www.mat.univie.ac.at/~neum/ms/StArt.pdf.
Ceberio, M., & Granvilliers, L. (2000). Solving nonlinear systems by constraint inversion and interval arithmetic. In AISC (pp. 127–141). http://link.springer.de/link/service/series/0558/bibs/1930/19300127.htm.
Chen, H. M., & van Emden, M. H. (1995). Adding interval constraints to the Moore–Skelboe global optimization algorithm. In V. Kreinovich (Ed.), Extended abstracts of APIC’95 of the international workshop on applications of interval computations (pp. 54–57).
Cleary, J. G. (1987). Logical arithmetic. Future Computing Systems, 2, 125–149.
Cruz, J., & Barahona, P. (2005). Constraint reasoning in deep biomedical models. Journal of Artificial Intelligence in Medicine, 34, 77–88. http://ssdi.di.fct.unl.pt/~pb/papers/ludi_constraints.pdf.
Dallwig, S., Neumaier, A., & Schichl, H. (1997). GLOPT—a program for constrained global optimization (pp. 19–36). Dordrecht: Kluwer.
Dallwig, S., Neumaier, A., & Schichl, H. (1997). GLOPT—a program for constrained global optimization. In I. Bomze, et al. (Ed.), Developments in global optimization (pp. 19–36). Dordrecht: Kluwer.
Daney, D., Grandon, C., & Papegay, Y. (2006). Combining CP and interval methods for solving the direct kinematic of a parallel robot under uncertainties. In IntCP 06 workshop. ftp://ftp-sop.inria.fr/coprin/daney/articles/intcp06.pdf.
Dimitrova, N. S., & Markov, S. M. (1981). Über die intervall-arithmetische Berechnung des Wertebereichs einer Funktion mit Anwendungen, Freiburger Intervall-Berichte. University of Freiburg, 81, 1–22.
Domes, F. (2009). GloptLab—a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems. Optimization Methods and Software, 24(4 & 5), 727–747. http://www.mat.univie.ac.at/~dferi/publ/Gloptlab.pdf.
Domes, F., & Neumaier, A. (2009). Directed Cholesky factorizations and applications. http://www.mat.univie.ac.at/~dferi/publ/Cholesky.pdf.
Domes, F., & Neumaier, A. (2009). Linear methods for quadratic constraint satisfaction problems. http://www.mat.univie.ac.at/~dferi/publ/.
Granvilliers, L., & Benhamou, F. (2006). Realpaver: An interval solver using constraint satisfaction techniques. ACM Transactions on Mathematical Software, 32, 38–156. http://www.sciences.univ-nantes.fr/info/perso/permanents/granvil/realpaver/.
Hager, G. D. (1993). Solving large systems of nonlinear constraints with application to data modeling. Interval Computations, 3, 169–200.
Hansen, R. E., & Walster, W. G. (2002). Sharp bounds on interval polynomial roots. Reliable Computing, 8, 115–122.
Hyvönen, E., & De Pascale, S. (1996). Interval computations on the spreadsheet. In R. B. Kearfott, & V. Kreinovich (Eds.), Applications of interval computations (pp. 169–209). Dordrecht: Kluwer.
Jaulin, L. (2000). Interval constraint propagation with application to bounded-error estimation. Automatica, 36, 1547–1552. https://www.ensieta.fr/e3i2/Jaulin/hull.pdf.
Jaulin, L. (2006). Interval constraints propagation techniques for the simultaneous localization and map building of an underwater robot. http://www.mat.univie.ac.at/~neum/glopt/gicolag/talks/jaulin.pdf.
Jaulin, L., Kieffer, M., Braems, I., & Walter, E. (1999). Guaranteed nonlinear estimation using constraint propagation on sets. International Journal of Control, 74, 1772–1782. https://www.ensieta.fr/e3i2/Jaulin/observer.pdf.
Jermann, C., Lebbah, Y., & Sam-Haroud, D. (2007). Interval analysis, constraint propagation and applications. In F. Benhamou, N. Jussien, & B. O’Sullivan (Eds.), Trends in constraint programming (chapter 4, pp. 223–259). ISTE.
Kearfott, R. B. (1991). Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems. Computing, 47, 169–191.
Krippahl, L., & Barahona, P. (2002). PSICO: Solving protein structures with constraint programming and optimization. Constraints, 7, 317–331. http://ssdi.di.fct.unl.pt/~pb/papers/ludi_constraints.pdf.
Lebbah, Y. (2003). iCOs – Interval COnstraints Solver. http://ylebbah.googlepages.com/icos.
Lebbah, Y., Michel, C., & Rueher, M. (2005). A rigorous global filtering algorithm for quadratic constraints. Constraints, 10, 47–65. http://ylebbah.googlepages.com/research.
Lodwick, A. W. (1989). Constraint propagation, relational arithmetic in ai systems and mathematical programs. Annals of Operation Research, 21, 143–148.
Merlet, J-P. (2004). Solving the forward kinematics of a Gough-type parallel manipulator with interval analysis. International Journal of Robotics Research, 23, 221–235. http://www-sop.inria.fr/coprin/equipe/merlet/Papers/IJRR2004.pdf.
Neumaier, A. (1990). Interval methods for systems of equations. In Encyclopedia of mathematics and its applications (Vol. 37). Cambridge: Cambridge University Press.
Neumaier, A. (2003). Enclosing clusters of zeros of polynomials. Journal of Computational and Applied Mathematics, 156, 389–401.
Neumaier, A. (2004). Complete search in continuous global optimization and constraint satisfaction. Acta Numerica, 1004, 271–369.
Older, W., & Vellino, A. (1993). Constraint arithmetic on real intervals. In F. Benhameou & A. Colmerauer (Eds.), Constrained logic programming: Selected research. Cambridge: MIT.
Sahinidis, N., & Tawarmalani, M. (2003). Convexification and global optimization in continuous and mixed–integer nonlinear programming: Theory, algorithms, software, and applications. Dordrecht: Kluwer.
Sahinidis, V. N., & Tawarmalani, M. (2005). BARON 7.2.5: Global optimization of mixed-integer nonlinear programs. User’s manual. http://www.gams.com/dd/docs/solvers/baron.pdf.
Schichl, H. (2003). Mathematical modeling and global optimization, habilitation thesis. http://www.mat.univie.ac.at/~herman/papers/habil.pdf.
Schichl, H., & Neumaier, A. (2005). Interval analysis on directed acyclic graphs for global optimization. Journal of Global Optimization, 33(4), 541–562.
Schichl, H., et al. (2000–2008). The COCONUT environment. Software. http://www.mat.univie.ac.at/coconut-environment.
van Emden, H. M. (2001). Computing functional and relational box consistency by structured propagation in atomic constraint systems. CoRR, cs.PL/0106008.
Van Hentenryck, P. (1998). A gentle introduction to numerica. Artifical Intelligence, 103, 209–235.
Van Hentenryck, P., Michel, L., & Benhamou, F. (1997). Newton: Constraint programming over non-linear constraints. Scientific Programming, 30, 83–118.
Van Hentenryck, P., Michel, L., & Deville, Y. (1997). Numerica. A modeling language for global optimization. Cambridge: MIT.
Vu, X.-H., Schichl, H., & Sam-Haroud, D. (2004). Using directed acyclic graphs to coordinate propagation and search for numerical constraint satisfaction problems. In Proceedings of the 16th IEEE international conference on tools with artificial intelligence (ICTAI 2004) (pp. 72–81). http://www.mat.univie.ac.at/~herman/papers/ICTAI2004.pdf.
Vu, X.-H., Schichl, H., & Sam-Haroud, D. (2007). Interval propagation and search on directed acyclic graphs for numerical constraint solving. Journal of Global Optimization, 39. http://www.mat.univie.ac.at/~herman/papers/FBPD-Hermann.pdf.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Domes, F., Neumaier, A. Constraint propagation on quadratic constraints. Constraints 15, 404–429 (2010). https://doi.org/10.1007/s10601-009-9076-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-009-9076-1