Recommendations
- Linear and parabolic relaxations for quadratic constraints
- A rigorous global filtering algorithm for quadratic constraints
- Constraint propagation on quadratic constraints
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Rigorous constraint satisfaction for sampled linear systems
Cites work
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 3022422 (Why is no real title available?)
- A convex envelope formula for multilinear functions
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A rigorous global filtering algorithm for quadratic constraints
- A scaling algorithm for polynomial constraint satisfaction problems
- Automatic computation of a linear interval enclosure
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint propagation on quadratic constraints
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Guaranteed non-linear estimation using constraint propagation on sets
- Interval Methods for Systems of Equations
- Interval analysis on directed acyclic graphs for global optimization
- Jointly constrained bilinear programs and related problems: An overview
- Lower bound functions for polynomials
- PSICO: Solving protein structures with constraint programming and optimization
- Safe bounds in linear and mixed-integer linear programming
- Validated Linear Relaxations and Preprocessing: Some Experiments
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(8)- Rigorous verification of feasibility
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Using interval unions to solve linear systems of equations with uncertainties
- Constraint aggregation for rigorous global optimization
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- A rigorous global filtering algorithm for quadratic constraints
- Linear and parabolic relaxations for quadratic constraints
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
This page was built for publication: Rigorous filtering using linear relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453629)
