Analysis of stochastic approximation schemes with discontinuous and dependent forcing terms with applications to data communication algorithms

Abstract

A general convergence result is given for stochastic approximation schemes with (or without) equality constraints. The following features are taken into account. The forcing term is a strongly dependent sequence and may be discontinuous. Many examples are given to illustrate the applicability of the convergence theorem, both classical (recursive least squares scheme) and nonclassical ones (arising in the theory of self-adaptive eqnalizers).