Constraint propagation on quadratic constraints

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. Keywords. Constraint propagation, constraint programming, continuous constraints, quadratic constraint satisfaction problems, rounding error control, verified computation, preprocessing, quadratic programming, constrained optimization.

• Type: Journal
• Year: 2010
• Where: CONSTRAINTS
• Authors: Ferenc Domes, Arnold Neumaier
• Keywords: Computer Networks, Constraint Propagation, Constraint Satisfaction Problems, CONSTRAINTS 2010, Quadratic Constraint