Harold Kushner, G. George Yin

Stochastic Approximation and Recursive Algorithms and Applications (eBook, PDF)

• Format: PDF

Produktbeschreibung

The book presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. The assumptions and proof methods are designed to cover the needs of recent applications. The development proceeds from simple to complex problems, allowing the underlying ideas to be more easily understood. Many examples illustrate the application of the theory. This second edition is a thorough revision, although the main features and the structure remain unchanged. It contains many additional applications and results, and more detailed discussion.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer US
• Seitenzahl: 478
• Erscheinungstermin: 4. Mai 2006
• Englisch
• ISBN-13: 9780387217697
• Artikelnr.: 43998542

Inhaltsangabe

Introduction: Applications and Issues.- Applications to Learning, Repeated Games, State Dependent Noise, and Queue Optimization.- Applications in Signal Processing, Communications, and Adaptive Control.- Mathematical Background.- Convergence with Probability One: Martingale Difference Noise.- Convergence with Probability One: Correlated Noise.- Weak Convergence: Introduction.- Weak Convergence Methods for General Algorithms.- Applications: Proofs of Convergence.- Rate of Convergence.- Averaging of the Iterates.- Distributed/Decentralized and Asynchronous Algorithms.

Rezensionen

From the reviews of the second edition: "This is the second edition of an excellent book on stochastic approximation, recursive algorithms and applications ... . Although the structure of the book has not been changed, the authors have thoroughly revised it and added additional material ... ." (Evelyn Buckwar, Zentralblatt MATH, Vol. 1026, 2004) "The book attempts to convince that ... algorithms naturally arise in many application areas ... . I do not hesitate to conclude that this book is exceptionally well written. The literature citation is extensive, and pertinent to the topics at hand, throughout. This book could be well suited to those at the level of the graduate researcher and upwards." (A. C. Brooms, Journal of the Royal Statistical Society Series A: Statistics in Society, Vol. 169 (3), 2006)