Almost sure convergence of a class of stochastic algorithms (Q1318333)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost sure convergence of a class of stochastic algorithms |
scientific article |
Statements
Almost sure convergence of a class of stochastic algorithms (English)
0 references
15 August 1995
0 references
The author considers a wide class of random algorithms searching for a fixed point of a non-random function. Under certain assumptions, the almost sure convergence of these procedures is shown. Moreover, the paper presents an application to annealing of EM procedure.
0 references
random algorithm
0 references
fixed point
0 references
stopping times
0 references
