Bayesian Algorithms for One-Dimensional GlobalOptimization

  • Authors:
  • M. Locatelli

  • Affiliations:
  • Università degli studi di Milano, Dipartimento di Scienze dell‘Informazione, Via Comelico, 39/41-20135 Milano, Italy (email: locatelli@hermes.mc.dsi.unimi.it)

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper Bayesian analysis and Wiener process are used in orderto build an algorithm to solve the problem of globaloptimization.The paper is divided in two main parts.In the first part an already known algorithm is considered: a new (Bayesian)stopping ruleis added to it and some results are given, such asan upper bound for the number of iterations under the new stopping rule.In the second part a new algorithm is introduced in which the Bayesianapproach is exploited not onlyin the choice of the Wiener model but also in the estimationof the parameter \sigma^2 of the Wiener process, whose value appears to bequite crucial.Some results about this algorithm are also given.