stochastic approximation recursive algorithms von kushner harold (7 Ergebnisse)

2., nd ed. Softcover version of original hardcover edition 2003. 235 mm x 155 mm, 744 g. XXII, 474 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Stochastic Modelling and Applied Probability, 35. Sprache: Englisch.

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Stochastic Approximation and Recursive Algorithms and Applications | Harold Kushner (u. a.) | Taschenbuch | Stochastic Modelling and Applied Probability | xxii | Englisch | 2010 | Springer | EAN 9781441918475 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The basic stochastic approximation algorithms introduced by Robbins and MonroandbyKieferandWolfowitzintheearly1950shavebeenthesubject of an enormous literature, both theoretical and applied. This is due to the large number of applications and the interesting theoretical issues in the analysis of 'dynamically de ned' stochastic processes. The basic paradigm is a stochastic di erence equation such as = + Y , where takes n+1 n n n n its values in some Euclidean space, Y is a random variable, and the 'step n size' > 0 is small and might go to zero as n . In its simplest form, n is a parameter of a system, and the random vector Y is a function of n 'noise-corrupted' observations taken on the system when the parameter is set to . One recursively adjusts the parameter so that some goal is met n asymptotically. Thisbookisconcernedwiththequalitativeandasymptotic properties of such recursive algorithms in the diverse forms in which they arise in applications. There are analogous continuous time algorithms, but the conditions and proofs are generally very close to those for the discrete time case. The original work was motivated by the problem of nding a root of a continuous function g ( ), where the function is not known but the - perimenter is able to take 'noisy' measurements at any desired value of . Recursive methods for root nding are common in classical numerical analysis, and it is reasonable to expect that appropriate stochastic analogs would also perform well.

Paperback. Zustand: Brand New. 2nd ed. edition. 474 pages. 8.82x6.06x1.42 inches. In Stock.

Zustand: gut. Stochastic Approximation and Recursive Algorithms and Applications (Stochastic Modelling and Applied Probability, 35, Band 35) In deutscher Sprache. pages.