Lipschitz optimization with noisy 0th order information

I will present an algorithm to optimize Lipschitz functions when only noisy 0th order information is available. The algorithm relies on a tree based structure and is called HOO (Hierarchical Optimistic Optimization). The analysis depends on the ‘near optimality dimension’ of the function which measures the size of the set of near optimal points.