Stability of Random Iterative Mappings
We consider a sequence of not necessarily i.i.d. random mappings that arise in discrete-time fixed-gain recursive estimation processes. This is related to the sequence generated by the discrete-time deterministic recursion defined in terms of the averaged field. The tracking error is majorated by an L-mixing process the moments of which can be estimated. Thus we get a discrete-time stochastic averaging principle. The paper is a simplification and extension of Gerencsér (1996).
Unable to display preview. Download preview PDF.
- Caines, P. E. (1988). Linear Stochastic Systems. Wiley.Google Scholar
- Djereveckii, D. P. and A.L. Fradkov. (1981). Applied theory of discrete adaptive control systems. Nauka, Moscow. In Russian.Google Scholar
- Gerencsér, L. and Zs. Vágó. (2001). A general framework for noise-free SPSA. In Proceedings of the 40-th Conference on Decision and Control, CDC’01, page submitted.Google Scholar
- Ljung, L. and T. Söderström. (1983). Theory andpractice of recursive identification. The MIT Press.Google Scholar