Skip to main content

Part of the book series: Applications of Mathematics ((SMAP,volume 22))

  • 1307 Accesses

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)

$${E_{{x,a}}}\left\{ {I\left( {{\theta_k} \in Q,k \leqslant n} \right)\left( {1 + {{\left| {{X_{{n + 1}}}} \right|}^q}} \right)} \right\} \leqslant {\mu_q}(Q)\left( {1 + {{\left| x \right|}^q}} \right)$$

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics