Constraint propagation with interval labels
Artificial Intelligence
Arc-consistency for continuous variables
Artificial Intelligence
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A Constraint Satisfaction Approach to a Circuit Design Problem
Journal of Global Optimization
Accelerating filtering techniques for numeric CSPs
Artificial Intelligence
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Safe bounds in linear and mixed-integer linear programming
Mathematical Programming: Series A and B
Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
SIAM Journal on Numerical Analysis
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Certified error bounds for uncertain elliptic equations
Journal of Computational and Applied Mathematics
Constructive interval disjunction
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint propagation on quadratic constraints
Constraints
GloMIQO: Global mixed-integer quadratic optimizer
Journal of Global Optimization
Hi-index | 0.00 |
This article 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 often unable to achieve a significant pruning of the domains of the variables occurring in quadratic constraint 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. The Simplex algorithm is then used to narrow the domains. Since most implementations of the Simplex work with floating point numbers and thus, are unsafe, we provide a procedure to generate safe linearizations. We also exploit a procedure provided by Neumaier and Shcherbina to get a safe objective value when calling the Simplex algorithm. With these two procedures, we prevent the Simplex algorithm from removing any solution while filtering linear constraint systems. Experimental results on classical benchmarks show that this new algorithm yields a much more effective pruning of the domains than local consistency filtering algorithms.