New algorithm for stochastic approximation (Corresp.)
Nandan Kumar Sinha, Michael Paul Griscik · IEEE Transactions on Information Theory · 1971
A general stochastic approximation algorithm is given along with assumptions and conditions necessary to show that it converges. Convergence is proven in the mean-square sense. The rate of convergence is shown to be better than two algorithms proposed previously.