AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs
From MaRDI portal
Publication:5125674
DOI10.1109/TAC.2019.2930234WikidataQ127449324 ScholiaQ127449324MaRDI QIDQ5125674
Publication date: 7 October 2020
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04118
Related Items (10)
Distributed adaptive Newton methods with global superlinear convergence ⋮ Online distributed detection of sensor networks with delayed information ⋮ Differentially private distributed online learning over time‐varying digraphs via dual averaging ⋮ Distributed delayed dual averaging for distributed optimization over time-varying digraphs ⋮ Linear convergence of distributed estimation with constraints and communication delays ⋮ Distributed multi-UAV trajectory optimization over directed networks ⋮ Asynchronous networked aggregative games ⋮ Fully asynchronous policy evaluation in distributed reinforcement learning over networks ⋮ AsySPA ⋮ Distributed composite optimization for multi-agent systems with asynchrony
Uses Software
This page was built for publication: AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs
