Title
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations
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.
Year
DOI
Venue
2002
10.1007/3-540-46135-3_8
CP
Keywords
Field
DocType
tight linear relaxation,quadratic constraint,quadratic constraints system,model distance relation,new algorithm yield,handling systems,significant pruning,quadratic equation,global filtering algorithm,quadratic equations,numerous application area,local consistency,effective pruning
Drawback,Local consistency,Mathematical optimization,Computer science,Filter (signal processing),Quadratic equation,Algorithm,Ranging,Artificial intelligence,Robotics
Conference
ISBN
Citations 
PageRank 
3-540-44120-4
14
1.14
References 
Authors
10
3
Name
Order
Citations
PageRank
Yahia Lebbah111519.34
Michel Rueher261359.81
Claude Michel310710.57