Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

Stochastic Approximation: A Dynamical Systems Viewpoint

Name: Stochastic Approximation: A Dynamical Systems Viewpoint
Brand: Springer
SKU: 45082050
Price: 106.09 EUR
Availability: InStock
Author: Vivek S. Borkar
ISBN: 9789819982776

Vivek S. Borkar

Idioma

Inglés

Libro electrónico Adobe ePub DRM

Editores Springer, enero 2024

This book serves as an advanced text for a graduate course on stochastic algorithms for the students... Descripción completa

Código Libristo: 45082050

260 b

106.09 €

En existencia Descarga instantánea

Clientes que también han comprado

La communication de crise - 6e ed. Thierry Libaert

Adobe ePub DRM

11.89 €

Cortines Dalba Primera

Tapa blanda

25.49 €

Überwinde deinen inneren Schweinehund Fabian Pscherer

Adobe ePub DRM

9.29 €

Historias Extrañas Eduardo Capistrano

Adobe ePub DRM

3.09 €

Šanon A4 s nýty D216 Pull Up Hnědý

binding.

74.59 €

N N N (Malenkij princ) Antuan de Sent-Ekzjuperi

Adobe ePub DRM

2.69 €

Kosmos, civilizace a křesťanství Václav Ryneš

Tapa dura

12.79 €

BL Forever vs. No More BL 01 Tabea Kamada

Tapa blanda

6.89 €

GIUSEPPE TARTINI: VOLUME 21B: SONATE DEL VOLUME AUTOGRAFO, N.24-26 E SENZA NUMERO PER VIOLINO E BASS TARTINI Libro

binding.

29.99 €

This book serves as an advanced text for a graduate course on stochastic algorithms for the students of probability and statistics, engineering, economics and machine learning. This second edition gives a comprehensive treatment of stochastic approximation algorithms based on the ordinary differential equation (ODE) approach which analyses the algorithm in terms of a limiting ODE. It has a streamlined treatment of the classical convergence analysis and includes several recent developments such as concentration bounds, avoidance of traps, stability tests, distributed and asynchronous schemes, multiple time scales, general noise models, etc., and a category-wise exposition of many important applications. It is also a useful reference for researchers and practitioners in the field.