Stochastic Approximation and Recursive Algorithms and Applications
Produs indisponibil momentan. Pentru comenzi va rugam trimiteti mail la adresa depozit2@prior.ro sau contactati-ne la numarul de telefon 021 210 89 28 Vedeti mai jos alte produse similare disponibile.
Cod produs/ISBN: 9780387008943
Disponibilitate: Acest produs nu este momentan in stoc
Editura: Springer
Limba: Engleza
Nr. pagini: 500
Coperta: Hardback
Dimensiuni: 15.6 x 2.7 x 23.4 cm
An aparitie: 2003
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.
Springer
Springer
An aparitie | 2003 |
Autor | Harold Kushner, G. George Yin |
Dimensiuni | 15.6 x 2.7 x 23.4 cm |
Editura | Springer |
Format | Hardback |
ISBN | 9780387008943 |
Limba | Engleza |
Nr pag | 500 |
Clientii ebookshop.ro nu au adaugat inca opinii pentru acest produs. Fii primul care adauga o parere, folosind formularul de mai jos.