Abstract
Convergence with probability one of a recursive stochastic approximation algorithm is considered. Some extensions of previous results for the Robbins-Monro and the Kiefer-Wolfowitz procedures are given. An inportant feature of the approach taken here is that the convergence analysis can be directly extended to more complex algorithms.

This publication has 0 references indexed in Scilit: