Fetching the paper…
Reading the bibliography…
We study distributed optimization to minimize a global objective that is a sum of smooth and strongly-convex local cost functions.
“Some methods of speeding up the convergence of iteration methods,”
B. Polyak, · 1964
Earlier work this paper cites.
Feedback systems: input-output properties
C. A. Desoer and M. Vidyasagar, · 1975
Earlier work this paper cites.
“Distributed asynchronous deterministic and stochastic gradient optimization algorithms,”
J. Tsitsiklis, D. P. Bertsekas, and M. Athans, · 1986
Earlier work this paper cites.
Introduction to optimization
B. Polyak, · 1987
Earlier work this paper cites.
“An incremental gradient (-projection) method with momentum term and adaptive stepsize rule,”
P. Tseng, · 1998
Earlier work this paper cites.
D. P. Bertsekas, · 1999
Earlier work this paper cites.
“Coordination of groups of mobile autonomous agents using nearest neighbor rules,”
A. Jadbabaie, J. Lin, and A. Morse, · 2003
Earlier work this paper cites.
“Gossip-based computation of aggregate information,”
D. Kempe, A. Dobra, and J. Gehrke, · 2003
Earlier work this paper cites.
“Distributed optimization in sensor networks,”
M. Rabbat and R. Nowak, · 2004
Earlier work this paper cites.
“Distributed subgradient methods for multi-agent optimization,”
A. Nedić and A. Ozdaglar, · 2009
Earlier work this paper cites.
“Consensus-based distributed support vector machines,”
P. A. Forero, A. Cano, and G. B. Giannakis, · 2010
Earlier work this paper cites.
“Distributed sparse linear regression,”
G. Mateos, J. A. Bazerque, and G. B. Giannakis, · 2010
Earlier work this paper cites.
“Distributed spectrum sensing for cognitive radio networks by exploiting sparsity,”
J. A. Bazerque and G. B. Giannakis, · 2010
Earlier work this paper cites.
“Discrete-time dynamic average consensus,”
M. Zhu and S. Martínez, · 2010
Earlier work this paper cites.
“Distributed optimization and statistical learning via the alternating direction method of multipliers,”
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, · 2011
Earlier work this paper cites.
“Dual averaging for distributed optimization: Convergence analysis and network scaling,”
J. C. Duchi, A. Agarwal, and M. J. Wainwright, · 2012
Earlier work this paper cites.
“Push-sum distributed dual averaging for convex optimization,”
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, · 2012
Earlier work this paper cites.
“Average consensus on general strongly connected digraphs,”
K. Cai and H. Ishii, · 2012
Earlier work this paper cites.
“Distributed alternating direction method of multipliers,”
E. Wei and A. Ozdaglar, · 2012
Earlier work this paper cites.
“D-ADMM: A communication-efficient distributed algorithm for separable optimization,”
J. F. C. Mota, J. M. F. Xavier, P. M. Q. Aguiar, and M. Puschel, · 2013
Earlier work this paper cites.
Matrix Analysis, 2 nd {}^{\mbox{\scriptsize nd}} ed
R. A. Horn and C. R. Johnson, · 2013
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov, · 2013
Cited alongside, same era.
“On the linear convergence of the admm in decentralized consensus optimization,”
W. Shi, Q. Ling, K Yuan, G Wu, and W Yin, · 2014
Cited alongside, same era.
“Fast distributed gradient methods,”
D. Jakovetić, J. Xavier, and J. M. F. Moura, · 2014
Cited alongside, same era.
“Diffusion adaptation over networks,”
A. H. Sayed, · 2014
Cited alongside, same era.
“A distributed algorithm for average consensus on strongly connected weighted digraphs,”
A. Priolo, A. Gasparri, E. Montijano, and C. Sagues, · 2014
Cited alongside, same era.
“Performance of first-order methods for smooth convex minimization: a novel approach,”
Y. Drori and M. Teboulle, · 2014
Cited alongside, same era.
“Exact diffusion for distributed optimization and learning—part ii: Convergence analysis,”
K. Yuan, B. Ying, X. Zhao, and A. H. Sayed, · 2017
Later among the works it cites.
“Harnessing smoothness to accelerate distributed optimization,”
G. Qu and N. Li, · 2017
Later among the works it cites.
“ADD-OPT: Accelerated distributed directed optimization,”
C. Xi, R. Xin, and U. A. Khan, · 2017
Later among the works it cites.
“Achieving geometric convergence for distributed optimization over time-varying graphs,”
A. Nedić, A. Olshevsky, and W. Shi, · 2017
Later among the works it cites.
“Accelerated distributed Nesterov gradient descent,”
G. Qu and N. Li, · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Distributed optimization over time-varying directed graphs,”
A. Nedić and A. Olshevsky, · 2015
Cited alongside, same era.
“Extra: An exact first-order algorithm for decentralized consensus optimization,”
W. Shi, Q. Ling, G. Wu, and W Yin, · 2015
Cited alongside, same era.
“Global convergence of the heavy-ball method for convex optimization,”
E. Ghadimi, H. R. Feyzmahdavian, and M. Johansson, · 2015
Cited alongside, same era.
“Cloud k-svd: A collaborative dictionary learning algorithm for big, distributed data,”
H. Raja and W. U. Bajwa, · 2016
Cited alongside, same era.
“Distributed subgradient projection algorithm over directed graphs,”
C. Xi and U. A. Khan, · 2016
Cited alongside, same era.
“On the convergence of decentralized gradient descent,”
K. Yuan, Q. Ling, and W. Yin, · 2016
Cited alongside, same era.
“Geometrically convergent distributed optimization with uncoordinated step-sizes,”
A. Nedić, A. Olshevsky, W. Shi, and C. A. Uribe, · 2017
Later among the works it cites.
“On the convergence rate of incremental aggregated gradient algorithms,”
M. Gurbuzbalaban, A. Ozdaglar, and P. A. Parrilo, · 2017
Later among the works it cites.
“Lyapunov functions: An optimization theory perspective,”
B. Polyak and P. Shcherbakov, · 2017
Later among the works it cites.
“Linearly convergent stochastic heavy ball method for minimizing generalization error,”
N. Loizou and P. Richtárik, · 2017
Later among the works it cites.
“Multi-agent reinforcement learning via double averaging primal-dual optimization,”
H.-T. Wai, Z. Yang, Z. Wang, and M. Hong, · 2018
Closest in time.
“Distributed localization: A linear theory,”
S. Safavi, U. A. Khan, S. Kar, and J. M. F. Moura, · 2018
Closest in time.
“Linear convergence in optimization over directed graphs with row-stochastic matrices,”
C. Xi, V. S. Mai, R. Xin, E. Abed, and U. A. Khan, · 2018
Closest in time.
“FROST – Fast row-stochastic optimization with uncoordinated step-sizes,”
R. Xin, C. Xi, and U. A. Khan, · 2018
Closest in time.
“A linear algorithm for optimization over directed graphs with geometric convergence,”
R. Xin and U. A. Khan, · 2018
Closest in time.
“A unification and generalization of exact distributed first order methods,”
D. Jakovetic, · 2018
Closest in time.
“Sucag: Stochastic unbiased curvature-aided gradient method for distributed optimization,”
H.-T. Wai, N. M. Freris, A. Nedić, and A. Scaglione, · 2018
Closest in time.
“A push-pull gradient method for distributed optimization in networks,”
S. Pu, W. Shi, J. Xu, and A. Nedić, · 2018
Closest in time.
“Convergence of asynchronous distributed gradient methods over stochastic networks,”
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, · 2018
Closest in time.
“Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes,”
Q. Lü, H. Li, and D. Xia, · 2018
Closest in time.
“Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,”
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, · 2060
Closest in time.