Rigorous verification of feasibility
From MaRDI portal
Publication:2018466
DOI10.1007/S10898-014-0158-2zbMATH Open1318.90065OpenAlexW2076242555MaRDI QIDQ2018466FDOQ2018466
Authors: Ferenc Domes, Arnold Neumaier 
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
Recommendations
global optimizationconstraint satisfactioninterval analysisverified computingrigorous feasibility verification
Cites Work
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- The optimization test environment
- Title not available (Why is that?)
- Title not available (Why is that?)
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Title not available (Why is that?)
- Super-fast validated solution of linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On proving existence of feasible points in equality constrained optimization problems
- Title not available (Why is that?)
- Benchmarking global optimization and constraint satisfaction codes
- Constraint aggregation for rigorous global optimization
- Constraint propagation on quadratic constraints
- Title not available (Why is that?)
- A scaling algorithm for polynomial constraint satisfaction problems
- Title not available (Why is that?)
- Rigorous filtering using linear relaxations
- Interval Slopes for Rational Functions and Associated Centered Forms
Cited In (11)
- Convergent upper bounds in global minimization with nonlinear equality constraints
- A branch and bound algorithm for quantified quadratic programming
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Numerical solution for bounding feasible point sets
- Some observations on exclusion regions in branch and bound algorithms
- Linear and parabolic relaxations for quadratic constraints
- Constraint aggregation for rigorous global optimization
- Certificates of infeasibility via nonsmooth optimization
- Some feasibility sampling procedures in interval methods for constrained global optimization
- Rigorous packing of unit squares into a circle
- Relaxed verification for continuous problems
Uses Software
This page was built for publication: Rigorous verification of feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018466)
