Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions

Jérôme Lelong

We study the almost sure convergence of randomly truncated stochastic algorithms. We present a new convergence theorem which extends the already known results by making vanish the…