Fetching the paper…
Reading the bibliography…
We study the problem of decentralized optimization over time-varying networks with strongly convex smooth cost functions.
Distributed non-autonomous power control through distributed convex optimization
Sundhar Srinivasan Ram, Venugopal V Veeravalli, and Angelia Nedic · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Libsvm: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Earlier work this paper cites.
Distributed alternating direction method of multipliers
Ermin Wei and Asuman Ozdaglar · 2012
Earlier work this paper cites.
First-order methods with inexact oracle: the strongly convex case
O. Devolder, F. Glineur, and Yu. Nesterov · 2013
Earlier work this paper cites.
First-order methods of smooth convex optimization with inexact oracle
Olivier Devolder, François Glineur, and Yurii Nesterov · 2014
Earlier work this paper cites.
Fast distributed gradient methods
Dušan Jakovetić, Joao Xavier, and José MF Moura · 2014
Earlier work this paper cites.
Extra: An exact first-order algorithm for decentralized consensus optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Earlier work this paper cites.
Communication complexity of distributed convex learning and optimization
Yossi Arjevani and Ohad Shamir · 2015
Earlier work this paper cites.
Accelerated distributed nesterov gradient descent
G. Qu and N. Li · 2016
Earlier work this paper cites.
Fast convergence rates for distributed non-bayesian learning
Angelia Nedić, Alex Olshevsky, and César A Uribe · 2017
Earlier work this paper cites.
Achieving geometric convergence for distributed optimization over time-varying graphs
Angelia Nedić, Alex Olshevsky, and Wei Shi · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié · 2017
Cited alongside, same era.
Fenchel dual gradient methods for distributed convex optimization over time-varying networks
X. Wu and J. Lu · 2017
Cited alongside, same era.
Optimal algorithms for non-smooth distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Laurent Massoulié, and Yin Tat Lee · 2018
Cited alongside, same era.
A push-pull gradient method for distributed optimization in networks
Shi Pu, Wei Shi, Jinming Xu, and Angelia Nedich · 2018
Cited alongside, same era.
A sharp convergence rate analysis for distributed accelerated gradient methods
The practicality of stochastic optimization in imaging inverse problems
Junqi Tang, Karen Egiazarian, Mohammad Golbabaee, and Mike Davies · 2019
Later among the works it cites.
Multi-consensus decentralized accelerated gradient descent
Haishan Ye, Luo Luo, Ziang Zhou, and Tong Zhang · 2020
Closest in time.
Revisiting extra for smooth distributed optimization
Huan Li and Zhouchen Lin · 2020
Closest in time.
An optimal algorithm for decentralized finite sum optimization
Hadrien Hendrikx, Francis Bach, and Laurent Massoulie · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Huan Li, Cong Fang, Wotao Yin, and Zhouchen Lin · 2018
Cited alongside, same era.
Distributed optimization using the primal-dual method of multipliers
G. Zhang and R. Heusdens · 2018
Cited alongside, same era.
Panda: A dual linearly converging method for distributed optimization over time-varying undirected graphs
Marie Maros and Joakim Jaldén · 2018
Cited alongside, same era.
A unification and generalization of exact distributed first order methods
D. Jakovetic · 2019
Cited alongside, same era.
Projected gradient method for decentralized optimization over time-varying networks
Alexander Rogozin and Alexander Gasnikov · 2019
Cited alongside, same era.
Darina Dvinskikh and Alexander Gasnikov · 2019
Cited alongside, same era.
Huan Li, Zhouchen Lin, and Yongchun Fang · 2020
Closest in time.
A dual approach for optimal algorithms in distributed optimization over networks
César A Uribe, Soomin Lee, Alexander Gasnikov, and Angelia Nedić · 2020
Closest in time.
Ideal: Inexact decentralized accelerated augmented lagrangian method
Yossi Arjevani, Joan Bruna, Bugra Can, Mert Gürbüzbalaban, Stefanie Jegelka, and Hongzhou Lin · 2020
Closest in time.
F. Stonyakin, A. Tyurin, A. Gasnikov, P. Dvurechensky, A. Agafonov, D. Dvinskikh, D. Pasechnyuk, S. Artamonov, and V. Piskunova · 2020
Closest in time.
A unified theory of decentralized sgd with changing topology and local updates
Anastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi, and Sebastian U Stich · 2020
Closest in time.
Decentralized accelerated gradient methods with increasing penalty parameters
Huan Li, Cong Fang, Wotao Yin, and Zhouchen Lin · 2020
Closest in time.
Accelerated and non accelerated stochastic gradient descent in model generality
Darina M Dvinskikh, Aleksandr Igorevich Turin, Alexander Vladimirovich Gasnikov, and Sergey Sergeevich Omelchenko · 2020
Closest in time.