A Rigorous Global Filtering Algorithm for Quadratic Constraints*

  title={A Rigorous Global Filtering Algorithm for Quadratic Constraints*},
  author={Yahia Lebbah and Claude Michel and Michel Rueher},
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… 

Rigorous filtering using linear relaxations

This paper presents rigorous filtering methods for continuous constraint satisfaction problems based on linear relaxations, designed to efficiently handle the linear inequalities coming from a linear

Constraint aggregation for rigorous global optimization

This paper shows that even when the verification of an approximate feasible point fails, the information extracted from the results of the local optimization can still be used in many cases to reduce the search space.

A branch and bound algorithm for quantified quadratic programming

The branch and bound algorithm presented in the paper handles both universally and existentially quantified parameters in a homogeneous way, without branching on their domains, and uses some dedicated numerical constraint programming techniques for finding a robust, global solution.

Constraint propagation on quadratic constraints

This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints, and the basic new techniques consist in eliminating bilinear entries from a quadRatic constraint, and solving the resulting separable quadratics constraints by means of a sequence of univariate quadrotic problems.

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems

A constraint programming (CP) approach to solve problems with strictly convex quadratic constraints and shows significant improvement compared to the default settings and state-of-the-art performance compared to competing technologies of mixed integer programming, semi-definite programming, and mixed integer nonlinear programming.

Hybrid Exact Methods for Solving Strictly Convex Integer Quadratic Programs

This dissertation exploits the similarities among three tree search algorithms, discrete ellipsoid-based search (DEBS), mixed integer programming (MIP), and constraint programming (CP) and integrate their techniques to develop efficient hybrid algorithms for solving strictly convex integer quadratic programs.

ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations

The purpose of this paper is to show how the extensible structure of ANTIGONE realizes the authors' previously-proposed mixed- integer quadratically-constrained quadratic program and mixed-integer signomial optimization computational frameworks.

GloMIQO: Global mixed-integer quadratic optimizer

GloMIQO is introduced, a numerical solver addressing mixed-integer quadratically-constrained quadratic programs to $${\varepsilon}$$-global optimality, and its algorithmic components are presented for reformulating user input, detecting special structure including convexity and edge-concavity, generating tight convex relaxations, and finding good feasible solutions.

Utilisation de solveurs de contraintes pour réduire les approximations produites par interprétation abstraite

This paper shows that constraint solvers over floating-point numbers and real numbers can significantly refine the approximations computed by Fluctuat, and manages to reduce drastically the domains of variables of C programs that are difficult to handle for abstract interpretation techniques implemented in this paper.



A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations

A global filtering algorithm that works on a tight linear relaxation of the quadratic constraints that yields a much more effective pruning of the domains than local consistency filtering algorithms.

Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

A new branch and prune algorithm that combines {\tt Quad}, local consistencies, and interval methods, is introduced that outperforms classical interval methods as well as constraint satisfaction problem solvers and it compares well with state-of-the-art optimization solvers.

A reformulation-convexification approach for solving nonconvex quadratic programming problems

This paper considers the class of linearly constrained nonconvex quadratic programming problems, and presents a new approach based on a novel Reformulation-Linearization/Convexification Technique, showing that for many problems, the initial relaxation itself produces an optimal solution.

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

A branch and cut algorithm that yields in finite time, a globally ε-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem.

A Constraint Programming Approach for Solving Rigid Geometric Systems

First experimental results show that this approach is more efficient than systems based on equational decomposition techniques and can be used not only to efficiently implement the solving phase, but also generalize former ad-hoc solving techniques.

A Constraint Satisfaction Approach to a Circuit Design Problem

A novel branch-and-prune algorithm is given that obtains a unique safe box for the above system within reasonable computation times and combines traditional interval techniques with an adaptation of discrete constraint-satisfaction techniques to continuous problems.

A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique

This paper is concerned with the development of an algorithm to solve continuous polynomial programming problems for which the objective function and the constraints are specified polynomials. A

Jointly Constrained Biconvex Programming

It is proved that the minimum of a biconcave function over a nonempty compact set occurs at a boundary point of the set and not necessarily an extreme point and the algorithm is proven to converge to a global solution of the nonconvex program.

Numerica: A Modeling Language for Global Optimization

A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

This paper presents RLT-Based Global Optimization Algorithms for Nonconvex Polynomial Programming Problems and Reformulation-Convexification Technique for Polynomials Programs: Design and Implementation, and some special applications to Discrete and Continuous Non Convex Programs.