Stochastic Approximation and Recursive Algorithms and Applications

• Main Authors: Kushner, Harold J. (Author), Yin, G. George. (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic
• Language: English
• Published: New York, NY : Springer New York, 2003.
• Edition: Second Edition.
• Series: Stochastic Modelling and Applied Probability, 35
• Subjects: Mathematics.; Artificial intelligence.; Approximation theory.; Applied mathematics.; Engineering mathematics.; Algorithms.; Probabilities.; Probability Theory and Stochastic Processes.; Artificial Intelligence (incl. Robotics).; Approximations and Expansions.; Applications of Mathematics.
• Online Access: View fulltext via EzAccess

 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.