A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions

Published Online:https://doi.org/10.1287/moor.2016.0821

References

  • Andrieu C, Moulines E, Priouret P (2005) Stability of stochastic approximation under verifiable conditions. SIAM J. Control Optim. 44(1):283–312.CrossrefGoogle Scholar
  • Aubin J, Cellina A (1984) Differential Inclusions: Set-Valued Maps and Viability Theory (Springer, Berlin).CrossrefGoogle Scholar
  • Aubin J, Frankowska H (1990) Set-Valued Analysis (Birkhäuser, Boston).Google Scholar
  • Benaïm M (1996) A dynamical system approach to stochastic approximations. SIAM J. Control Optim. 34(2):437–472.CrossrefGoogle Scholar
  • Benaïm M (1999) Dynamics of stochastic approximation algorithms. Séminaire de probabilités XXXIII (Springer, Berlin), 1–68.CrossrefGoogle Scholar
  • Benaïm M, Hirsch MW (1996) Asymptotic pseudotrajectories and chain recurrent flows, with applications. J. Dynam. Differential Equations 8(1):141–176.CrossrefGoogle Scholar
  • Benaïm M, Sorin S, Hofbauer J (2005) Stochastic approximations and differential inclusions. SIAM J. Control Optim. 44(1):328–348.CrossrefGoogle Scholar
  • Benaïm M, Sorin S, Hofbauer J (2012) Perturbations of set-valued dynamical systems, with applications to game theory. Dynam. Games Appl. 2(2):195–205.CrossrefGoogle Scholar
  • Bhatnagar S, Prasad H, Prashanth L (2012) Stochastic Recursive Algorithms for Optimization: Simultaneous Perturbation Methods. Lecture Notes in Control and Information Sciences, Vol. 434 (Springer, London).Google Scholar
  • Borkar VS, Meyn SP (1999) The O.D.E. method for convergence of stochastic approximation and reinforcement learning. SIAM J. Control Optim. 38(2):447–469.CrossrefGoogle Scholar
  • Borkar VS (2008) Stochastic Approximation: A Dynamical Systems Viewpoint (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Kushner H, Yin G (2003) Stochastic Approximation and Recursive Algorithms and Applications (Springer, New York).Google Scholar
  • Ljung L (1977) Analysis of recursive stochastic algorithms. Automatic Control, IEEE Trans. 22(4):551–575.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.