The following pages link to (Q4295107):
Displaying 10 items.
- Interval arithmetic with containment sets (Q858179) (← links)
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007) (← links)
- PROFIL/BIAS - A fast interval library (Q1340873) (← links)
- The convergence speed of interval methods for global optimization (Q1361290) (← links)
- Verified solution of large systems and global optimization problems (Q1900761) (← links)
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- Interval methods for global optimization (Q1914643) (← links)
- Interval operations involving NaNs (Q1916991) (← links)
- Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers (Q1924483) (← links)
