Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols

DOI10.1109/TIT.2021.3113285zbMath1489.65053arXiv1905.08645OpenAlexW3199566590MaRDI QIDQ5030260

Nicolas Loizou, Peter Richtárik

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.08645

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Network design and communication in computer systems (68M10) Iterative numerical methods for linear systems (65F10)

Related Items (5)

Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^* ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ The method of randomized Bregman projections for stochastic feasibility problems

This page was built for publication: Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols