Computable Convergence Rate Bound for Ratio Consensus Algorithms-Reference-Cited by-同舟云学术

Computable Convergence Rate Bound for Ratio Consensus Algorithms

Published:2022 Issue: Volume:6 Page:3307-3312
ISSN:2475-1456
Container-title:IEEE Control Systems Letters
language:
Short-container-title:IEEE Control Syst. Lett.

Author:

Gerencser Balazs¹^ORCID

Affiliation:

1. Department of Probability and Statistics, Alfréd Rényi Institute of Mathematics, Budapest, Hungary

Funder

National Research, Development and Innovation Office

János Bolyai Research Scholarship of the Hungarian Academy of Sciences

ÚNKP-20-5 New National Excellence Program of the Ministry for Innovation and Technology from the source of the National Research, Development and Innovation Fund

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Control and Optimization,Control and Systems Engineering

Link

http://xplorestaging.ieee.org/ielx7/7782633/9462165/09800934.pdf?arnumber=9800934

Reference22 articles.

1. Adaptation, Learning, and Optimization over Networks

2. Average Consensus in the Presence of Delays in Directed Graph Topologies

3. Analysis of Sum-Weight-Like Algorithms for Averaging in Wireless Sensor Networks

4. Tight bounds on the convergence rate of generalized ratio consensus algorithms

5. The Lyapunov exponent and joint spectral radius of pairs of matrices are hard?when not impossible?to compute and to approximate

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

1. Low Complexity Convergence Rate Bounds for the Synchronous Gossip Subclass of Push-Sum Algorithms;IEEE Control Systems Letters;2024