scispace - formally typeset
Open AccessJournal ArticleDOI

Multivariate stochastic approximation using a simultaneous perturbation gradient approximation

James C. Spall
- 01 Mar 1992 - 
- Vol. 37, Iss: 3, pp 332-341
Reads0
Chats0
TLDR
The paper presents an SA algorithm that is based on a simultaneous perturbation gradient approximation instead of the standard finite-difference approximation of Keifer-Wolfowitz type procedures that can be significantly more efficient than the standard algorithms in large-dimensional problems.
Abstract
The problem of finding a root of the multivariate gradient equation that arises in function minimization is considered. When only noisy measurements of the function are available, a stochastic approximation (SA) algorithm for the general Kiefer-Wolfowitz type is appropriate for estimating the root. The paper presents an SA algorithm that is based on a simultaneous perturbation gradient approximation instead of the standard finite-difference approximation of Keifer-Wolfowitz type procedures. Theory and numerical experience indicate that the algorithm can be significantly more efficient than the standard algorithms in large-dimensional problems. >

read more

Content maybe subject to copyright    Report






Citations
More filters
Journal ArticleDOI

Optimization of traffic lights operation using network load data

TL;DR: In this paper, artificial neural networks and randomized algorithms of stochastic approximation allow building systems for traffic lights operation control that take into account various non-linear stochiastic relations between locally observed network loads.
Posted Content

On Stochastic Gradient and Subgradient Methods with Adaptive Steplength Sequences

TL;DR: In this article, two adaptive steplength schemes for strongly convex differentiable stochastic optimization problems, equipped with convergence theory, are presented, referred to as recursive and cascading, respectively.
Journal ArticleDOI

Stochastic approximation driven particle swarm optimization with simultaneous perturbation -Who will guide the guide?

TL;DR: Two efficient solutions to remedy the problem of poor gbest update of PSO using a stochastic approximation technique, based on the formation of an alternative or artificial global best particle, the so-called aGB, which can replace the native gbest particle for a better guidance.
Proceedings ArticleDOI

Multi-robot 3D coverage of unknown terrains

TL;DR: A new approach that is based on the Cognitive-based Adaptive Optimization (CAO) algorithm is proposed and evaluated and it is established that the proposed approach provides an efficient methodology that can easily incorporate any particular constraints and quickly and safely navigate the robots to an arrangement that optimizes surveillance coverage.
DissertationDOI

Pricing American options - aspects of computation

Milos Plavsic
TL;DR: It is proved that, in the case of the LSM algorithm, the general belief that Monte Carlo simulatio ns become more and more efficient with the increase in the number of iterations within the simulation does not necessari ly hold.
References
More filters
Journal ArticleDOI

Stochastic Estimation of the Maximum of a Regression Function

TL;DR: In this article, the authors give a scheme whereby, starting from an arbitrary point, one obtains successively $x_2, x_3, \cdots$ such that the regression function converges to the unknown point in probability as n \rightarrow \infty.
Journal ArticleDOI

Multidimensional Stochastic Approximation Methods

TL;DR: In this paper, a multidimensional stochastic approximation scheme is presented, and conditions are given for these schemes to converge a.s.p.s to the solutions of $k-stochastic equations in $k$ unknowns.
Journal ArticleDOI

Accelerated Stochastic Approximation

TL;DR: In this article, the Robbins-Monro procedure and the Kiefer-Wolfowitz procedure are considered, for which the magnitude of the $n$th step depends on the number of changes in sign in $(X_i - X_{i - 1})$ for n = 2, \cdots, n.