Abstract | ||
---|---|---|
This paper proposes a novel exact asynchronous subgradient-push algorithm (AsySPA) to solve an additive cost optimization problem over digraphs where each node only has access to a local convex function and updates asynchronously with an arbitrary rate. Specifically, each node of a strongly connected digraph does not wait for updates from other nodes but simply starts a new update within any bound... |
Year | DOI | Venue |
---|---|---|
2020 | 10.1109/TAC.2019.2930234 | IEEE Transactions on Automatic Control |
Keywords | DocType | Volume |
Delays,Convergence,Optimization,Synchronization,Convex functions,Clocks,Distributed algorithms | Journal | 65 |
Issue | ISSN | Citations |
6 | 0018-9286 | 5 |
PageRank | References | Authors |
0.42 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhang, Jiaqi | 1 | 73 | 11.73 |
Keyou You | 2 | 831 | 50.16 |