Pages that link to "Item:Q2250091"
From MaRDI portal
The following pages link to On rigorous upper bounds to a global optimum (Q2250091):
Displaying 13 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- On consistency of bounding operations in deterministic global optimization (Q1101343) (← links)
- On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
- Numerical solution for bounding feasible point sets (Q1398432) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- Interval computations, rigour and non-rigour in deterministic continuous global optimization (Q3093044) (← links)
- Optimal Search for the Global Maximum of Functions with Bounded Seminorm (Q3719735) (← links)
- On the Optimality and Limitations of Buehler Bounds (Q4665374) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)
- Global Optimization and Constraint Satisfaction (Q5897044) (← links)