Abstract | ||
---|---|---|
We consider distributed optimization with smooth convex objective functions defined on an undirected connected graph. Inspired by mirror descent mehod and RLC circuits, we propose a novel distributed mirror descent method. Compared with mirror-prox method, our algorithm achieves the same O (1/k) iteration complexity with only half the computation cost per iteration. We further extend our results t... |
Year | DOI | Venue |
---|---|---|
2020 | 10.1109/LCSYS.2020.2972908 | IEEE Control Systems Letters |
Keywords | DocType | Volume |
Mirrors,Linear programming,RLC circuits,Optimization,Convergence,Aerodynamics,Complexity theory | Journal | 4 |
Issue | ISSN | Citations |
3 | 2475-1456 | 1 |
PageRank | References | Authors |
0.35 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yue Yu | 1 | 219 | 29.56 |
Behçet Açikmese | 2 | 41 | 15.88 |