Non-asymptotic error bounds for constant stepsize stochastic approximation for tracking mobile agents-Reference-Cited by-同舟云学术

Non-asymptotic error bounds for constant stepsize stochastic approximation for tracking mobile agents

Published:2019-10-25 Issue:4 Volume:31 Page:589-614
ISSN:0932-4194
Container-title:Mathematics of Control, Signals, and Systems
language:en
Short-container-title:Math. Control Signals Syst.

Author:

Kumar Bhumesh^ORCID,Borkar Vivek,Shetty Akhil

Funder

Department of Science and Technology, Ministry of Science and Technology

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Control and Optimization,Signal Processing,Control and Systems Engineering

Link

http://link.springer.com/content/pdf/10.1007/s00498-019-00249-4.pdf

Reference48 articles.

1. Alekseev VM (1961) An estimate for the perturbations of the solutions of ordinary differential equations. Westnik Moskov Unn Ser 1:28–36

2. Anantharam V, Borkar VS (2012) Stochastic approximation with long range dependent and heavy tailed noise. Queueing Syst 71(1–2):221–242

3. Bach F. Moulines E (2013) Non-strongly-convex smooth stochastic approximation with convergence rate O (1/n). In: Advances in neural information processing systems, pp 773–781

4. Benveniste A (1987) Design of adaptive algorithms for the tracking of time-varying systems. Int J Adapt Control Signal Process 19(1):3–29

5. Benveniste A, Ruget G (1982) A measure of the tracking capability of recursive stochastic algorithms with constant gains. IEEE Trans Autom Control 47(3):639–649

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Constant Stepsize Algorithms;Texts and Readings in Mathematics;2023

2. Constant Stepsize Algorithms;Texts and Readings in Mathematics;2022

3. On the Convergence of Consensus Algorithms with Markovian noise and Gradient Bias;2020 59th IEEE Conference on Decision and Control (CDC);2020-12-14