Rigorous filtering using linear relaxations
From MaRDI portal
Publication:453629
DOI10.1007/s10898-011-9722-1zbMath1275.90051OpenAlexW2054800954MaRDI QIDQ453629
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
global optimizationquadratic programmingbranch and boundfilteringpruningverified computingcontinuous constraintslinear relaxationsrounding error controlquadratic constraint satisfaction problems
Related Items
A review of computation of mathematically rigorous bounds on optima of linear programs, Using interval unions to solve linear systems of equations with uncertainties, Rigorous verification of feasibility, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, Constraint aggregation for rigorous global optimization, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Constraint propagation on quadratic constraints
- Interval analysis on directed acyclic graphs for global optimization
- Jointly constrained bilinear programs and related problems: An overview
- A scaling algorithm for polynomial constraint satisfaction problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A convex envelope formula for multilinear functions
- Lower bound functions for polynomials
- Safe bounds in linear and mixed-integer linear programming
- A rigorous global filtering algorithm for quadratic constraints
- PSICO: Solving protein structures with constraint programming and optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Guaranteed non-linear estimation using constraint propagation on sets
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Interval Methods for Systems of Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Complete search in continuous global optimization and constraint satisfaction
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Automatic computation of a linear interval enclosure
