Stochastic approximation for Monte Carlo optimization

In this paper, we introduce two convergent Monte Carlo algorithms for optimizing complex stochastic systems. The first algorithm, which is applicable to regenerative processes, operates by estimating finite differences. The second method is of Robbins-Monro type and is applicable to Markov chains. The algorithm is driven by derivative estimates obtained via a likelihood ratio argument.

[1]  Kai Lai Chung,et al.  A Course in Probability Theory , 1949 .

[2]  Walter L. Smith,et al.  Regenerative stochastic processes , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[3]  M. Metivier,et al.  Applications of a Kushner and Clark lemma to general classes of stochastic algorithms , 1984, IEEE Trans. Inf. Theory.