Rigorous filtering using linear relaxations
DOI10.1007/S10898-011-9722-1zbMATH Open1275.90051OpenAlexW2054800954MaRDI QIDQ453629FDOQ453629
Authors: Ferenc Domes, Arnold Neumaier 
Publication date: 27 September 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9722-1
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
quadratic programmingglobal optimizationpruningfilteringbranch and boundcontinuous constraintslinear relaxationsrounding error controlverified computingquadratic constraint satisfaction problems
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Jointly constrained bilinear programs and related problems: An overview
- A convex envelope formula for multilinear functions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Complete search in continuous global optimization and constraint satisfaction
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Automatic computation of a linear interval enclosure
- Lower bound functions for polynomials
- Constraint propagation on quadratic constraints
- Safe bounds in linear and mixed-integer linear programming
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Interval analysis on directed acyclic graphs for global optimization
- A rigorous global filtering algorithm for quadratic constraints
- Title not available (Why is that?)
- A scaling algorithm for polynomial constraint satisfaction problems
- Guaranteed non-linear estimation using constraint propagation on sets
- PSICO: Solving protein structures with constraint programming and optimization
Cited In (8)
- Using interval unions to solve linear systems of equations with uncertainties
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Linear and parabolic relaxations for quadratic constraints
- Constraint aggregation for rigorous global optimization
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- Rigorous verification of feasibility
- A review of computation of mathematically rigorous bounds on optima of linear programs
- A rigorous global filtering algorithm for quadratic constraints
Uses Software
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)
