Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

DOI10.1137/S0036142903436174MaRDI QIDQ5698733zbMATH OpenFDO

Authors Yahia Lebbah, Claude Michel, Michel Rueher, David Daney, Jean-Pierre Merlet

Publication date 28 October 2005

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0036142903436174

zbMATH Keywords

branch and prune algorithmsconstraint programmingglobal constraintinterval arithmeticreformulation linearization techniquesafe roundingsystems of equations and inequalities

Mathematics Subject Classification ID

General methods in interval analysis (65G40) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A rigorous global filtering algorithm for quadratic constraints
• Solving Polynomial Systems Using a Branch and Prune Approach
• An efficient and safe framework for solving optimization problems
• Solving numerical constraints
• Linear and parabolic relaxations for quadratic constraints

Cited in

(17)

• Enhancing numerical constraint propagation using multiple inclusion representations
• Domain reduction techniques for global NLP and MINLP optimization
• How efficient is a global constraint in practice? A fair experimental framework
• A rigorous global filtering algorithm for quadratic constraints
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
• An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test
• Improving inter-block backtracking with interval Newton
• A review of computation of mathematically rigorous bounds on optima of linear programs
• Validated constraints solving --- practicalities, pitfalls, and new developments
• Finding all solutions of separable systems of piecewise-linear equations using integer programming
• Upper bounding in inner regions for global optimization under inequality constraints
• Reverse propagation of McCormick relaxations
• Hybridizing two linear relaxation techniques in interval-based solvers
• LP narrowing: A new strategy for finding all solutions of nonlinear equations
• Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
• An efficient and safe framework for solving optimization problems
• Adaptive constructive interval disjunction: algorithms and experiments

Describes a project that uses

Uses Software

• MPFI

This page was built for publication: Efficient and Safe Global Constraints for Handling Numerical Constraint Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5698733)