Pages that link to "Item:Q710752"
From MaRDI portal
The following pages link to Branch and bound algorithms for maximizing expected improvement functions (Q710752):
Displaying 5 items.
- Expected improvement in efficient global optimization through bootstrapped Kriging (Q445325) (← links)
- Computer simulation-based optimisation: hybrid branch and bound and orthogonal array-based enumeration algorithm (Q711555) (← links)
- Expected improvement for expensive optimization: a review (Q2022176) (← links)
- On the choice of the low-dimensional domain for global optimization via random embeddings (Q2301180) (← links)
- A Sequential Design Approach for Calibrating Dynamic Computer Simulators (Q5237193) (← links)