Continuous-time stochastic approximation: Convergence and asymptotic efficiency
From MaRDI portal
Recommendations
Cites work
- Acceleration of Stochastic Approximation by Averaging
- An Extension of the Robbins-Monro Procedure
- Analysis of recursive stochastic algorithms
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
- scientific article; zbMATH DE number 3878095 (Why is no real title available?)
- scientific article; zbMATH DE number 3780265 (Why is no real title available?)
- Multivariate adaptive stochastic approximation
- On extensions of Polyak's averaging approach to stochastic approximation
- Robustness analysis for stochastic approximation algorithms
- Stochastic approximation methods for constrained and unconstrained systems
Cited in
(10)- Convergence analysis of dynamic stochastic approximation
- On a continuous time stochastic approximation problem
- Asymptotic expansions for the stochastic approximation averaging procedure in continuous time
- Two-timescale stochastic gradient descent in continuous time with applications to joint online parameter estimation and optimal sensor placement
- Continuous-time Kiefer-Wolfowitz algorithm with randomized differences
- scientific article; zbMATH DE number 3965945 (Why is no real title available?)
- Asymptotically efficient stochastic approximation
- scientific article; zbMATH DE number 683389 (Why is no real title available?)
- scientific article; zbMATH DE number 850380 (Why is no real title available?)
- Extremum seeking under stochastic noise and applications to mobile sensors
This page was built for publication: Continuous-time stochastic approximation: Convergence and asymptotic efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885240)