TITLE

Stochastic Approximation to Understand Simple Simulation Models

AUTHOR(S)
Izquierdo, Segismundo; Izquierdo, Luis
PUB. DATE
April 2013
SOURCE
Journal of Statistical Physics;Apr2013, Vol. 151 Issue 1/2, p254
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper illustrates how a deterministic approximation of a stochastic process can be usefully applied to analyse the dynamics of many simple simulation models. To demonstrate the type of results that can be obtained using this approximation, we present two illustrative examples which are meant to serve as methodological references for researchers exploring this area. Finally, we prove some convergence results for simulations of a family of evolutionary games, namely, intra-population imitation models in n-player games with arbitrary payoffs.
ACCESSION #
86449488

 

Related Articles

  • Optimal Convergence Rate of the Randomized Algorithms of Stochastic Approximation in Arbitrary Noise. Granichin, O. N. // Automation & Remote Control;Feb2003, Vol. 64 Issue 2, p252 

    Multidimensional stochastic optimization plays an important role in analysis and control of many technical systems. To solve the challenging multidimensional problems of optimization, it was suggested to use the randomized algorithms of stochastic approximation with perturbed input which are not...

  • Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor. Faure, Mathieu; Roth, Gregory // Mathematics of Operations Research;Aug2010, Vol. 35 Issue 3, p624 

    A successful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well-chosen mean differential equation. Under an attainability condition, Benaïm proved that convergence to a given attractor...

  • A stochastic approximation algorithm with varying bounds. Andradôttir, Sigrün // Operations Research;Nov/Dec95, Vol. 43 Issue 6, p1037 

    Many optimization problems that are intractable with conventional approaches will yield to stochastic approximation algorithms. This is because these algorithms can be used to optimize functions that cannot be evaluated analytically, but have to be estimated (for instance, through simulation) or...

  • On the convergence of a stochastic approximation procedure for estimating the quantile criterion in the case of a discontinuous distribution function. Kan, Yu. S. // Automation & Remote Control;Feb2011, Vol. 72 Issue 2, p283 

    We study the almost surely convergence of a stochastic approximation procedure for the quantile criterion estimation. We take into account the case when the distribution function of the loss function has a discontinuity at a point coinciding with the quantile criterion value. We show that the...

  • An SQP-Type Method and Its Application in Stochastic Programs. Wei, Z.; Qi, L.; Chen, X. // Journal of Optimization Theory & Applications;Jan2003, Vol. 116 Issue 1, p205 

    In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the...

  • Convergence of bivariate interpolation and its computation. Li Shiying // Applied Mechanics & Materials;2014, Issue 543-547, p1773 

    The problem constructed here is the convergence of bivariate trigonometric interpolation sequences, the approximation and computation would be optimal for a body of functions. Therefore some conclusions became a special cased of the results of present paper.

  • Comparing thermal wave function methods for multi-configuration time-dependent Hartree simulations. Lorenz, U.; Saalfrank, P. // Journal of Chemical Physics;1/28/2014, Vol. 140 Issue 4, p044106-1 

    We compare two methods for creating stochastic temperature wave functions that can be used for Multi-Configuration Time-Dependent Hartree (MCTDH) simulations. In the first method, the MCTDH coefficients are chosen randomly, while the other method uses a single Hartree product of random...

  • Alien Genetic Algorithm for Exploration of Search Space. Patel, Narendra; Padhiyar, Nitin // AIP Conference Proceedings;10/26/2010, Vol. 1298 Issue 1, p325 

    Genetic Algorithm (GA) is a widely accepted population based stochastic optimization technique used for single and multi objective optimization problems. Various versions of modifications in GA have been proposed in last three decades mainly addressing two issues, namely increasing convergence...

  • Algorithm for stochastic approximation with trial input perturbation in the nonstationary problem of optimization. Vakhitov, A. T.; Granichin, O. N.; Gurevich, L. S. // Automation & Remote Control;Nov2009, Vol. 70 Issue 11, p1827 

    Consideration was given to the randomized stochastic approximation algorithm with simultaneous trial input perturbation and two measurements used to optimize the unconstrained nonstationary functional. The upper boundary of the mean-square residual was established under conditions of single...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics