Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
From MaRDI portal
Publication:1749336
DOI10.1016/j.sysconle.2017.12.002zbMath1386.93019OpenAlexW2779077171MaRDI QIDQ1749336
Publication date: 16 May 2018
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2017.12.002
Stochastic network models in operations research (90B15) Least squares and related methods for stochastic control systems (93E24) Decentralized systems (93A14) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization ⋮ Discrete-time stochastic consensus: a Kalman-filter-based two-time-scale protocol
Cites Work
- Distributed consensus for multi-agent systems with delays and noises in transmission channels
- Continuous-time stochastic consensus: stochastic approximation and Kalman-Bucy filtering based protocols
- Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions
- Identification and stochastic adaptive control
- Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies
- Fast linear iterations for distributed averaging
- Asynchronous Stochastic Approximation Algorithms for Networked Systems: Regime-Switching Topologies and Multiscale Structure
- Approximate Consensus in Stochastic Networks With Application to Load Balancing
- A Mean Square Consensus Protocol for Linear Multi-Agent Systems With Communication Noises and Fixed Topologies
- Stochastic Approximation Based Consensus Dynamics over Markovian Networks
- Distributed Average Consensus With Dithered Quantization
- Adaptive Filter Algorithms for Accelerated Discrete-Time Consensus
- Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
- Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise
- Accelerated Distributed Average Consensus via Localized Node State Prediction
- Robust Consensus in the Presence of Impulsive Channel Noise
- Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies
- Consensus Conditions of Multi-Agent Systems With Time-Varying Topologies and Stochastic Communication Noises
- Convergence Speed in Distributed Consensus and Averaging
- Coordination and Consensus of Networked Agents with Noisy Measurements: Stochastic Algorithms and Asymptotic Behavior
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stochastic Approximation for Consensus: A New Approach via Ergodic Backward Products
- Stochastic Approximation Approach for Consensus and Convergence Rate Analysis of Multiagent Systems
- Degree Fluctuations and the Convergence Time of Consensus Algorithms
- Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging
This page was built for publication: Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
