|
Avtomatika i Telemekhanika, 2005, Issue 3, Pages 91–96
(Mi at1343)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Adaptive and Robust Systems
A probability estimate for not exceeding the unknown threshold by the Robbins–Monro algorithm
T. P. Krasulina, Yu. O. Yatel Saint-Petersburg State University
Abstract:
The one-sided convergence of the modified Robbins–Monro process is studied [1]. A method for choosing the algorithm constants is designed such that the probability for not exceeding the unknown root of the regression equation is arbitrarily close to 1.
Citation:
T. P. Krasulina, Yu. O. Yatel, “A probability estimate for not exceeding the unknown threshold by the Robbins–Monro algorithm”, Avtomat. i Telemekh., 2005, no. 3, 91–96; Autom. Remote Control, 66:3 (2005), 422–426
Linking options:
https://www.mathnet.ru/eng/at1343 https://www.mathnet.ru/eng/at/y2005/i3/p91
|
Statistics & downloads: |
Abstract page: | 247 | Full-text PDF : | 71 | References: | 44 | First page: | 1 |
|