Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions - Mathematics > ProbabilityReportar como inadecuado




Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions - Mathematics > Probability - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We study the almost sure convergence of randomly truncated stochasticalgorithms. We present a new convergence theorem which extends the alreadyknown results by making vanish the classical condition on the noise terms. Theaim of this work is to prove an almost sure convergence result of randomlytruncated stochastic algorithms under easily verifiable conditions



Autor: Jérôme Lelong CERMICS

Fuente: https://arxiv.org/







Documentos relacionados