A Strong Approximation Theorem for Stochastic Recursive Algorithms
- 1 March 1999
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 100 (3) , 499-513
- https://doi.org/10.1023/a:1022630321574
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Searching for the Best: Stochastic Approximation, Simulated Annealing and Related ProceduresPublished by Springer Nature ,1996
- Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $SIAM Journal on Control and Optimization, 1993
- Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $SIAM Journal on Control and Optimization, 1991
- Ergodic control of multidimensional diffusions, II: Adaptive controlApplied Mathematics & Optimization, 1990
- Convergent activation dynamics in continuous time networksNeural Networks, 1989
- Mimicking the one-dimensional marginal distributions of processes having an ito differentialProbability Theory and Related Fields, 1986
- A remark on the attainable distributions of controlled diffusionsStochastics, 1986
- Statistics of Random Processes IPublished by Springer Nature ,1977
- Bounds for the fundamental solution of a parabolic equationBulletin of the American Mathematical Society, 1967