Sequential Optimization and Computer Experiments

Every day, one pick a point $x$ and observe the (possibly noisy) value of an unknown function $f$ at point $x$. How to find as fast as possible the minimum value of $f$? In this introductory talk, we will discuss some possible answers of this question. We will focus on the answers inspired on bandit models.