Skip to Main Content
A new algorithm for stochastic approximation has been proposed, along with the assumptions and conditions necessary for convergence. It has been proved by two different methods that the algorithm converges to the sought value in the mean-square sense and with probability one. The rate of convergence of the new algorithm is shown to be better than two existing algorithms under certain conditions. Results of simulation have been given, making a realistic comparison between the three algorithms.