A rigorous global filtering algorithm for quadratic constraints
From MaRDI portal
Publication:1774519
DOI10.1007/s10601-004-5307-7zbMath1066.90090OpenAlexW2051735096MaRDI QIDQ1774519
Claude Michel, Michel Rueher, Yahia Lebbah
Publication date: 17 May 2005
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-004-5307-7
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A branch and bound algorithm for quantified quadratic programming, A review of computation of mathematically rigorous bounds on optima of linear programs, GLOMIQO: global mixed-integer quadratic optimizer, Constraint propagation on quadratic constraints, Domain reduction techniques for global NLP and MINLP optimization, Constructive Interval Disjunction, Rigorous filtering using linear relaxations, Certified error bounds for uncertain elliptic equations, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Constraint aggregation for rigorous global optimization, Enhancing numerical constraint propagation using multiple inclusion representations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Jointly constrained bilinear programs and related problems: An overview
- Constraint propagation with interval labels
- A constraint satisfaction approach to a circuit design problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems
- Arc-consistency for continuous variables
- Rigorous global search: continuous problems
- Safe bounds in linear and mixed-integer linear programming
- Accelerating filtering techniques for numeric CSPs
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Comparing partial consistencies
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
