Name
Abstract | ||
|---|---|---|
In this article, we consider distributed online convex optimization problems, where the distributed system consists of various computing units connected through a time-varying communication graph. In each time step, each computing unit selects a constrained vector, experiences a loss equal to an arbitrary convex function evaluated at this vector, and may communicate to its neighbors in the graph. ... |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TAC.2021.3057601 | IEEE Transactions on Automatic Control |
Keywords | DocType | Volume |
Optimization,Convex functions,Distributed algorithms,Upper bound,Unsolicited e-mail,Robots,Time-varying systems | Journal | 67 |
Issue | ISSN | Citations |
3 | 0018-9286 | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deming Yuan | 1 | 36 | 3.01 |
| Alexandre Proutiere | 2 | 558 | 40.94 |
| guodong shi | 3 | 711 | 54.50 |