The following pages link to (Q4874513):
Displaying 14 items.
- Some feasibility sampling procedures in interval methods for constrained global optimization (Q506473) (← links)
- Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- A gentle introduction to Numerica (Q1274762) (← links)
- On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
- How to guarantee finite termination of verifying global optimization codes (Q1300086) (← links)
- Numerical solution for bounding feasible point sets (Q1398432) (← links)
- Credal networks (Q1575697) (← links)
- Interval analysis: Theory and applications (Q1587412) (← links)
- Exclusion regions for optimization problems (Q2250096) (← links)
- An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems (Q2568646) (← links)
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization (Q3509411) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)