Advertisement

Journal of Global Optimization

, Volume 1, Issue 4, pp 331–340 | Cite as

On when to stop sampling for the maximum

  • C. G. E. Boender
  • A. H. G. Rinnooy Kan
Article

Abstract

Suppose a sequential sample is taken from an unknown discrete probability distribution on an unknown range of integers, in an effort to sample its maximum. A crucial issue is an appropriate stopping rude determining when to terminate the sampling process. We approach this problem from a Bayesian perspective, and derive stopping rules that minimize loss functions which assign a loss to the sample size and to the deviation between the maximum in the sample and the true (unknown) maximum. We will show that our rules offer an extremely simple approximate solution to the well-known problem to terminate the Multistart method for continuous global optimization.

Key words

Bayesian stopping rules Multistart 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Betro, B. and F. Schoen (1987), Sequential Stopping Rules for the Multistart Algorithm in Global Optimization, Mathematical Programming 38.Google Scholar
  2. Boender, C. G. E. and A. H. G. Rinnooy Kan (1987), Bayesian Stopping Rules for Multi-start Global Optimization Methods, Mathematical Programming 36.Google Scholar
  3. Boender C. G. E. and A. H. G. Rinnooy Kan (1990), A Bayesian Learning Procedure for the (s, Q) Inventory Policy, Statistica Neerlandica 44, 3.Google Scholar
  4. De Groot M. H. (1978), Optimal Statistical Decisions, McGraw-Hill, New-York.Google Scholar
  5. Dixon L. C. W. and G. P. Szegö (1975), Towards Global Optimisation, North-Holland, Amsterdam.Google Scholar
  6. Lin, S. (1965), Computer Solutions for the Travelling Salesman Problem, Bell. Syst. Tech. J. 44.Google Scholar
  7. Lindley D. V. (1978), Bayesian Statistics: A Review, Society for Industrial and Applied Mathematics, Philadelphia.Google Scholar
  8. Piccioni, M. and A. Ramponi (1991), Stopping Rules for the Multistart Method When Different Local Minima Have Different Function Values, to appear in Optimization.Google Scholar
  9. Press H. P., B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling (1986), Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, New-York.Google Scholar
  10. Rinnooy Kan, A. H. G. and G. T. Timmer (1987), Stochastic Global Optimization Methods. Part I: Clustering Methods, Part II; Multi Level Methods, Mathematical Programming 39.Google Scholar
  11. Wilks S. S. (1962), Mathematical Statistics, Wiley, New-York.Google Scholar
  12. Zielinski, R. (1981), A Statistical Estimate of the Structure of Multi-Extremal Problems, Mathematical Programming 21.Google Scholar

Copyright information

© Kluwer Academic Publishers 1991

Authors and Affiliations

  • C. G. E. Boender
    • 1
  • A. H. G. Rinnooy Kan
    • 1
  1. 1.Erasmus University RotterdamRotterdamThe Netherlands

Personalised recommendations