Finding fixed points of functions by stochastic approximation method

Authors

  • Tatiana P. Krasulina

Abstract

In this paper, a stochastic approximation method is used to find a fixed point of a function observed with an additive error. The result is obtained under the assumptions of Gladyshev’s theorem on root finding problem. It is also assumed that the function is either a pseudo-contraction, or relaxed contraction, or hemi-contraction, or quasi-contraction, or generalized contraction. By using techniques based on super-martingales, it is shown that a modified Robbins-Monro process converges to the fixed point with probability one. The established theorem is less restrictive than a prior result by S. V. Komarov since this theorem imposes no special requirements to the studied function. Refs 4.

Downloads

Download data is not yet available.

References

1. Граничин О.Н., Поляк Б.Т. Рандомизированные алгоритмы оценивания и оптимизации при почти произвольных помехах. М.: Наука, 2003. 291 с.

2. Kushner H.J., Yin G.G. Stochastic Approximation Algorithms and Applications. New York: Springer-Verlag, 2002. 416 p.

3. Комаров С.В. О нахождении неподвижных точек случайных отображений методом стохастической аппроксимации // Вестник С-Петерб. ун-та. Сер. 1. 1992. Вып. 1. С. 108-110.

4. Невельсон М.Б., Хасьминский Р.З. Стохастическая аппроксимация и рекуррентное оценивание. М.: Наука, 1972. 304 с.

Published

2020-08-20

How to Cite

Krasulina, T. P. (2020). Finding fixed points of functions by stochastic approximation method. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 4(1), 22–24. Retrieved from https://math-mech-astr-journal.spbu.ru/article/view/8571

Issue

Section

Mathematics