Asynchronous Gossip-Based Random Projection Algorithms Over Networks
From MaRDI portal
Publication:2980601
DOI10.1109/TAC.2015.2460051zbMath1359.68020arXiv1304.1757MaRDI QIDQ2980601
Publication date: 3 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.1757
Network design and communication in computer systems (68M10) Distributed systems (68M14) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (9)
Distributed Nash equilibrium seeking: a gossip-based algorithm ⋮ Multi-cluster distributed optimization via random sleep strategy ⋮ Distributed Optimization Over Weight-Balanced Digraphs with Event-Triggered Communication ⋮ Asynchronous gossip-based gradient-free method for multiagent optimization ⋮ Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach ⋮ Distributed optimization over directed graphs with row stochasticity and constraint regularity ⋮ Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks ⋮ Distributed stochastic gradient tracking methods ⋮ Multi-agent control: a graph-theoretic perspective
This page was built for publication: Asynchronous Gossip-Based Random Projection Algorithms Over Networks
