Adaptive constructive interval disjunction: algorithms and experiments
From MaRDI portal
Recommendations
Cites work
- A polyhedral branch-and-cut approach to global optimization
- A rigorous ODE solver and Smale's 14th problem
- Consistency in networks of relations
- Constructive Interval Disjunction
- Contractor programming
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Extensions of affine arithmetic: application to unconstrained global optimization
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 2084731 (Why is no real title available?)
- scientific article; zbMATH DE number 1543292 (Why is no real title available?)
- Robust autonomous robot localization using interval analysis
Cited in
(7)- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- A generic interval branch and bound algorithm for parameter estimation
- Constructive Interval Disjunction
- Node selection strategies in interval branch and bound algorithms
- Hybridizing two linear relaxation techniques in interval-based solvers
- Global solution of quadratic problems using interval methods and convex relaxations
This page was built for publication: Adaptive constructive interval disjunction: algorithms and experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903916)