Convergence of recursive adaptive and identification procedures via weak convergence theory
- 1 December 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 22 (6) , 921-930
- https://doi.org/10.1109/tac.1977.1101647
Abstract
Results and concepts in the theory of weak convergence of a sequence of probability measures are applied to convergence problems for a variety of recursive adaptive (stochastic approximation-like) methods. Similar techniques have had wide applicability in areas of operations research and in some other areas in stochastic control. It is quite likely that they will play a much more important role in control theory than they do at present, since they allow relatively simple and natural proofs for many types of convergence and approximation problems. Part of the aim of the paper is tutorial: to introduce the ideas and to show how they might be applied. Also, many of the results are new, and they can all be generalized in many directions.Keywords
This publication has 7 references indexed in Scilit:
- Rates of Convergence for Sequential Monte Carlo Optimization MethodsSIAM Journal on Control and Optimization, 1978
- Analysis of recursive stochastic algorithmsIEEE Transactions on Automatic Control, 1977
- General convergence results for constrained and unconstrained stochastic approximationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- A Survey of Some Applications of Probability and Stochastic Control Theory to Finite Difference Methods for Degenerate Elliptic and Parabolic EquationsSIAM Review, 1976
- Counterexamples to general convergence of a commonly used recursive identification methodIEEE Transactions on Automatic Control, 1975
- Weak convergence in queueing theoryAdvances in Applied Probability, 1973
- Limit Theorems for Stochastic ProcessesTheory of Probability and Its Applications, 1956