On the convergence of linear stochastic approximation procedures

DOI10.1109/18.508865zbMath0854.60041OpenAlexW2116863403MaRDI QIDQ4885743

Michael A. Kouritzin

Publication date: 5 January 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.508865

zbMATH Keywords

adaptive filteringstochastic approximationalmost sure convergencedependent random variablesrecursive algorithmsRobbins-Monro process

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Signal detection and filtering (aspects of stochastic processes) (60G35) Limit theorems in probability theory (60F99)

Related Items (4)

A sliding-window approximation-based fractional adaptive strategy for Hammerstein nonlinear ARMAX systems ⋮ An Algorithm for Accurate Distributed Time Synchronization in Mobile Wireless Sensor Networks from Noisy Difference Measurements ⋮ EXPLICIT HESTON SOLUTIONS AND STOCHASTIC APPROXIMATION FOR PATH-DEPENDENT OPTION PRICING ⋮ Convergence Rates and Decoupling in Linear Stochastic Approximation Algorithms

This page was built for publication: On the convergence of linear stochastic approximation procedures