G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
From MaRDI portal
Publication:3396394
DOI10.1080/10556780902917701zbMath1180.90217OpenAlexW2031580761MaRDI QIDQ3396394
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780902917701
interval analysisconstraint satisfaction problemsverified computingrounding error controloptimization software
Related Items (14)
Interval unions ⋮ Algorithmic differentiation techniques for global optimization in the COCONUT environment ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Certificates of infeasibility via nonsmooth optimization ⋮ Constraint propagation on quadratic constraints ⋮ Rigorous filtering using linear relaxations ⋮ Global optimization ⋮ A scaling algorithm for polynomial constraint satisfaction problems ⋮ First order rejection tests for multiple-objective optimization ⋮ Rigorous verification of feasibility ⋮ Constraint aggregation for rigorous global optimization ⋮ GLOPTLAB ⋮ The optimization test environment
Uses Software
This page was built for publication: G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
