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.
EUR 63,85 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 25,54 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : Magus Books Seattle, Seattle, WA, Etats-Unis
Hardcover. Etat : VG. used hardcover copy in illustrated boards, no jacket, as issued. light shelfwear, corners perhaps slightly bumped. pages and binding are clean, straight and tight. there are no marks to the text or other serious flaws. N° de réf. du vendeur 1453331
Quantité disponible : 1 disponible(s)
Vendeur : Salish Sea Books, Bellingham, WA, Etats-Unis
Etat : Very Good. 2. Very Good; Hardcover; Light wear to the covers; Unblemished textblock edges; The endpapers and all text pages are clean and unmarked; The binding is excellent with a straight spine; This book will be shipped in a sturdy cardboard box with foam padding; Medium Format (8.5" - 9.75" tall); Tan and yellow covers with title in yellow lettering; 2nd Edition; 2003, Springer-Verlag Publishing; 500 pages; "Stochastic Approximation and Recursive Algorithms and Applications (Stochastic Modelling and Applied Probability, 35)," by Harold Kushner & G. George Yin. N° de réf. du vendeur SKU-044AT02105011
Quantité disponible : 1 disponible(s)
Vendeur : Toscana Books, AUSTIN, TX, Etats-Unis
Hardcover. Etat : new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. N° de réf. du vendeur Scanned0387008942
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9780387008943_new
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780387008943
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. 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 458427650
Quantité disponible : Plus de 20 disponibles
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2215580170578
Quantité disponible : Plus de 20 disponibles
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Hardcover. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA77303870089426
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. 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. N° de réf. du vendeur 9780387008943
Quantité disponible : 2 disponible(s)