Hostname: page-component-6766d58669-nf276 Total loading time: 0 Render date: 2026-05-16T17:45:54.262Z Has data issue: false hasContentIssue false

A note on stochastic search methods for global optimization

Published online by Cambridge University Press:  01 July 2016

D. P. Kennedy*
Affiliation:
University of Cambridge
*
Postal address: Statistical Laboratory, University of Cambridge, 16 Mill Lane, Cambridge CB2 1SB, UK.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let [An, Bn ] be random subintervals of [0, 1] defined recursively as follows. Let A 1 = 0, B 1 = 1 and take Cn , D n to be the minimum and maximum of k, i.i.d. random points uniformly distributed on [An, Bn ]. Choose [An+1, Bn+ 1] to be [Cn , Bn ], [Any Dn ] or [Cn , Dn ] with probabilities p, q, r respectively, p + q + r = 1. It is shown that the limiting distribution of [Any Bn ] has the beta distribution on [0,1] with parameters k(p + r) and k(q + r). The result is used to consider a randomized version of Golden Section search.

Information

Type
Letters to the Editor
Copyright
Copyright © Applied Probability Trust 1988