Constraint propagation on quadratic constraints

Ferenc Domes(ferenc.domesunivie.ac.at)
Neumaier Arnold(arnold.neumaierunivie.ac.at)

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.

Keywords: constraint propagation, constraint programming, continuous constraints, quadratic constraint satisfaction problems, rounding error control, verified computation, preprocessing, quadratic programming, constrained optimization

Category 1: Nonlinear Optimization (Quadratic Programming )

Category 2: Nonlinear Optimization (Bound-constrained Optimization )

Citation: University of Vienna, 2008

Download: [PDF]

Entry Submitted: 03/19/2008
Entry Accepted: 03/19/2008
Entry Last Modified: 03/19/2008

Modify/Update this entry