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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Universitätsbuchhandlung Herta Hold GmbH, Berlin, Allemagne
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. N° de réf. du vendeur 2691LB
Quantité disponible : 2 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 500 pp. Englisch. N° de réf. du vendeur 9781441918475
Quantité disponible : 2 disponible(s)
Vendeur : GoldBooks, Denver, CO, Etats-Unis
Etat : new. N° de réf. du vendeur 39U60_71_1441918477
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar2411530293679
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 stru. N° de réf. du vendeur 4172421
Quantité disponible : Plus de 20 disponibles
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Stochastic Approximation and Recursive Algorithms and Applications | Harold Kushner (u. a.) | Taschenbuch | 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. N° de réf. du vendeur 107207865
Quantité disponible : 5 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 500 2nd Edition. N° de réf. du vendeur 263091062
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 500 pp. Englisch. N° de réf. du vendeur 9781441918475
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781441918475
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 500 31 Illus. N° de réf. du vendeur 5805481
Quantité disponible : 4 disponible(s)