Abstract
In the stochastic algorithms studied in Chapter 1 there is a fairly strong condition on the moments of the process (Xn)n≥0 (Assumption (A.5)): for any compact set Q, there exists a constant μq(Q) < ∞ such that for any initial condition (x, a)
As soon as the evolution of the process (Xn) depends on the sequence (θn) (unlike the equaliser discussed in Chapter 2), as in the algorithm with general linear dynamics, there is no reason for (A.5) to be satisfied.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Benveniste, A., Métivier, M., Priouret, P. (1990). Analysis of the Algorithm in the General Case. In: Adaptive Algorithms and Stochastic Approximations. Applications of Mathematics, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75894-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-75894-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-75896-6
Online ISBN: 978-3-642-75894-2
eBook Packages: Springer Book Archive