(1) Department of Computer Sciences, University of Milano, via Comelico 39/41, I-20135 Milano, Italy
Abstract:
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented.