Stochastic Approximation and Recursive Algorithms and Applications (Stochastic Modelling and Applied Probability, 35) - Hardcover

Kushner, Harold; Yin, G. George

Hardcover

ISBN 10: 0387008942 ISBN 13: 9780387008943

Publisher: Springer, 2003

Synopsis

This book presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. This second edition is a thorough revision, although the main features and structure remain unchanged. It contains many additional applications and results as well as more detailed discussion.

About this title

From the Back Cover:

 

This revised and expanded second edition presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. There is a complete development of both probability one and weak convergence methods for very general noise processes. The proofs of convergence use the ODE method, the most powerful to date. 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. Rate of convergence, iterate averaging, high-dimensional problems, stability-ODE methods, two time scale, asynchronous and decentralized algorithms, state-dependent noise, stability methods for correlated noise, perturbed test function methods, and large deviations methods are covered. Many motivating examples from learning theory, ergodic cost problems for discrete event systems, wireless communications, adaptive control, signal processing, and elsewhere illustrate the applications of the theory.

Review:

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)

About this edition

• Publisher: Springer
• Publication date: 2003
• ISBN 10: 0387008942
• ISBN 13: 9780387008943
• Binding: Hardcover
• Edition number: 2
• Number of pages: 500