Rigorous verification of feasibility
From MaRDI portal
Publication:2018466
DOI10.1007/s10898-014-0158-2zbMath1318.90065OpenAlexW2076242555MaRDI QIDQ2018466
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0158-2
global optimizationinterval analysisconstraint satisfactionverified computingrigorous feasibility verification
Related Items
Linear and parabolic relaxations for quadratic constraints, A branch and bound algorithm for quantified quadratic programming, Rigorous packing of unit squares into a circle, Some feasibility sampling procedures in interval methods for constrained global optimization, Convergent upper bounds in global minimization with nonlinear equality constraints, Constraint aggregation for rigorous global optimization, Some observations on exclusion regions in branch and bound algorithms, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigorous filtering using linear relaxations
- Constraint propagation on quadratic constraints
- Super-fast validated solution of linear systems
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- A scaling algorithm for polynomial constraint satisfaction problems
- On proving existence of feasible points in equality constrained optimization problems
- The optimization test environment
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Interval Slopes for Rational Functions and Associated Centered Forms
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Global Optimization and Constraint Satisfaction
- Constraint aggregation for rigorous global optimization
