Results 31 to 40 of about 1,164,335 (299)
On a Stochastic Approximation Method [PDF]
The Annals of Mathematical Statistics, 1954 Asymptotic properties are established for the Robbins-Monro [1] procedure of stochastically solving the equation $M(x) = \alpha$. Two disjoint cases are treated in detail. The first may be called the "bounded" case, in which the assumptions we make are similar to those in the second case of Robbins and Monro. The second may be called the "quasi-linear"
openaire +3 more sources
On Consensus-Based Distributed Blind Calibration of Sensor Networks
Sensors, 2018 This paper deals with recently proposed algorithms for real-time distributed blind macro-calibration of sensor networks based on consensus (synchronization). The algorithms are completely decentralized and do not require a fusion center.
Miloš S. Stanković +4 more
doaj +1 more source
Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
Mathematics, 2023 One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management.
Shuang Lin, Jie Zhang, Chen Qiu
doaj +1 more source
Remote Sensing, 2012 Given multiple widespread stationary data sources such as ground-based sensors, an unmanned aircraft can fly over the sensors and gather the data via a wireless link. Performance criteria for such a network may incorporate costs such as trajectory length
Ben Pearre, Timothy X. Brown
doaj +1 more source
Stochastic Approximations and Differential Inclusions [PDF]
SIAM Journal on Control and Optimization, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benaïm, Michel +2 more
openaire +4 more sources
Asynchronous Stochastic Approximations [PDF]
SIAM Journal on Control and Optimization, 1998 The asymptotic behavior of a distributed, asynchronous stochastic approximation scheme is analyzed in terms of a limiting nonautonomous differential equation. The relation between the latter and the relative values of suitably rescaled relative frequencies of updates of different components is underscored.
openaire +3 more sources
Approximations for Stochastic Graph Rewriting [PDF]
, 2014 In this note we present a method to compute approximate descriptions of a class of stochastic systems. For the method to apply, the system must be presented as a Markov chain on a state space consisting in graphs or graph-like objects, and jumps must be described by transformations which follow a finite set of local rules.
Vincent Danos +3 more
openaire +4 more sources
On parameter estimation for stochastic logistic growth laws through the maximum likelihood procedure
Lietuvos Matematikos Rinkinys, 2004 A three alternative stochastic logistic growth models (exponential, Verhulst, Gompertz) are used for modelling of growth processes. The aim of this paper is to develop stochastic growth curves for all three stochastic growth models.
Petras Rupšys
doaj +3 more sources
The asymptotic error of chaos expansion approximations for stochastic differential equations
Modern Stochastics: Theory and Applications, 2019 In this paper we present a numerical scheme for stochastic differential equations based upon the Wiener chaos expansion. The approximation of a square integrable stochastic differential equation is obtained by cutting off the infinite chaos expansion in ...
Tony Huschto +2 more
doaj +1 more source
A Note on Stochastic Approximation [PDF]
Proceedings of the American Mathematical Society, 1958 1. A theorem on convergence of a sequence of random variables is proved in ?2. In ?3 this theorem is applied to prove convergence of a class of stochastic approximation procedures. The author was unable to verify whether the theorem of ?3 could be derived from the general convergence theorem for stochastic approximation procedures due to Dvoretzky [I].
openaire +2 more sources