Fetching the paper…
Reading the bibliography…
In this paper, we study the communication and (sub)gradient computation costs in distributed optimization and give a sharp complexity analysis for the proposed distributed accelerated gradient methods.
Y. Nesterov, “A method for unconstrained convex minimization problem with the rate of convergence O ( 1 / k 2 ) {O}(1/k^{2}) ,” Doklady AN SSSR
1983
Earlier work this paper cites.
Y. Nesterov, “On an approach to the construction of optimal methods of minimization of smooth convex functions,” Èkonomika I Mateaticheskie Metody
1988
Earlier work this paper cites.
Kluwer Academic, Boston, 2004
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course · 2004
Earlier work this paper cites.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Systems and Control Letters
2004
Earlier work this paper cites.
S. Boyd, P. Diaconis, and L. Xiao, “Fastest mixing markov chain on a graph,” SIAM Review
2004
Earlier work this paper cites.
Y. Nesterov, “Smooth minimization of non-smooth functions,” Mathematical Programming
2005
Earlier work this paper cites.
W. Ren, “Consensus based formation control strategies for multi-vehicle systems,” in American Control Conference (ACC)
2006
Earlier work this paper cites.
S. Ram, V. Veeravalli, and A. Nedic, “Distributed non-autonomous power control through distributed convex optimization,” in International Conference on Computer Communications (INFOCOM)
2009
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences
2009
Earlier work this paper cites.
J. Bazerque and G. Giannakis, “Distributed spectrum for cognitive radio networks by exploiting sparsity,” IEEE transactions on Signal Processing
2010
Earlier work this paper cites.
P. Forero, A. Cano, and G. Giannakis, “Consensus-based distributed support vector machines,” Journal of Machine Learning Research
2010
Earlier work this paper cites.
S. Ram, A. Nedic̀, and V. V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” Journal of Optimization Theory and Applications
2010
Earlier work this paper cites.
T. Zhang and H. Yu, “Average consensus for directed networks of multi-agent with time-varying delay,” in International Conference in Swarm Intelligence (ICSI)
2010
Earlier work this paper cites.
A. Agarwal and J. Duchi, “Distributed delayed stochastic optimization,” in Advances in Neural Information Processing Systems (NIPS)
2011
Earlier work this paper cites.
A. Nedić, “Asynchronous broadcast-based convex optimization over a network,” IEEE Transactions on Automatic Control
2011
Earlier work this paper cites.
H. Terelius, U. Topcu, and R. Murray, “Decentralized multi-agent optimization via dual decomposition,” IFAC proceedings volumes
2011
Earlier work this paper cites.
T. Erseghe, D. Zennaro, E. Dall’Anese, and L. Vangelista, “Fast consensus by the alternating direction multipliers method,” IEEE Transactions on Signal Processing
2011
Earlier work this paper cites.
A. Chambolle and T. Pock, “A first-order primal-dual algorithm for convex problems with applications to imaging,” Journal of Mathematical Imaging and Vision
2011
Cited alongside, same era.
J. Liu and A. S. Morse, “Accelerated linear iterations for distributed averaging,” Annual Reviews in Control
2011
Cited alongside, same era.
M. Schmidt, N. L. Roux, and F. R. Bach, “Convergence rates of inexact proximal-gradient methods for convex optimization,” in Advances in Neural Information Processing Systems (NIPS)
2011
Cited alongside, same era.
O. Dekel, R. Gilad-Bachrach, O. Shamir, and L. Xiao, “Optimal distributed online prediction using mini-batches,” Journal of Machine Learning Research
2012
Cited alongside, same era.
E. Wei and A. Ozdaglar, “On the o ( 1 / k ) o(1/k) convergence of asynchronous distributed alternating direction method of multipliers,” in IEEE Global Conference on Signal and Information Processing (GlobalSIP)
Y. Chow, W. Shi, T. Wu, and W. Yin, “Expander graph and communication-efficient decentralized optimization,” in Asilomar Conference on Signals, Systems and Computers (ACSSC)
2016
Later among the works it cites.
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié, “Optimal algorithms for smooth and strongly convex distributed optimization in networks,” in International Conference on Machine Learning (ICML)
2017
Later among the works it cites.
A. Nedić, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,” SIAM Journal on Optimization
2017
Later among the works it cites.
A. Makhdoumi and A. Ozdaglar, “Convergence rate of distributed ADMM over networks,” IEEE Transactions on Automatic Control
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…
2013
Cited alongside, same era.
G. Lan and R. D. Monteiro, “Iteration-complexity of first-order penalty methods for convex programming,” Mathematical Programming
2013
Cited alongside, same era.
D. Jakovetić, J. Xavier, and J. M. F. Moura, “Fast distributed gradient methods,” IEEE Transactions on Automatic Control
2014
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “On the linear convergence of the ADMM in decentralized consensus optimization,” IEEE Transactions on Signal Processing
2014
Cited alongside, same era.
M. Arioli and J. Scott, “Chebyshev acceleration of iterative refinement,” Numerical Algorithms
2014
Cited alongside, same era.
O. Devolder, F. Glineur, and Y. Nesterov, “First-order methods of smooth convex optimization with inexact oracle,” Mathematical Programming
2014
Cited alongside, same era.
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,” in IEEE Conference on Decision and Control (CDC)
2015
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “EXREA: An exact first-order algorithm for decentralized consensus optimization,” SIAM Journal Optimization
2015
Cited alongside, same era.
2017
Later among the works it cites.
2018
Closest in time.
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié, “Optimal algorithms for non-smooth distributed optimization in networks,” in Advances in Neural Information Processing Systems (NeurIPS)
2018
Closest in time.
G. Qu and N. Li, “Harnessing smoothness to accelerate distributed optimization,” IEEE Transactions on Control of Network Systems
2018
Closest in time.
H. Yu and M. Neely, “On the convergence time of dual subgradient methdos for strongly convex programs,” IEEE Transactions on Automatic Control
2018
Closest in time.
N. Aybat, Z. Wang, T. Lin, and S. Ma, “Distributed linearized alternating direction method of multipliers for composite convex consensus optimization,” IEEE Transactions on Automatic Control
2018
Closest in time.
A. Nedić, A. Olshevsky, and M. Rabbat, “Network topology and communication-computation tradeoffs in decentralized optimization,” Proceedings of the IEEE
2018
Closest in time.
K. Scaman, F. Bach, S. Bubeck, Y. Lee, and L. Massoulié, “Optimal convergence rates for convex distributed optimization in networks,” Journal of Machine Learning Research
2019
Closest in time.
A. Berahas, R. Bollapragada, N. Keskar, and E. Wei, “Balancing communication and computation in distributed optimization,” IEEE Transactions on Automatic Control
2019
Closest in time.
D. Jakovetić, “A unification and generatliztion of exact distributed first order methods,” IEEE Transactions on Signal and Information Processing over Networks
2019
Closest in time.
I. Necoara, A. Patrascu, and F. Glineur, “Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming,” Optimization Methods and Software
2019
Closest in time.
H. Li and Z. Lin, “Accelerated alternating direction method of multipliers: an optimal O ( 1 / K ) {O}(1/{K}) nonergodic analysis,” Journal of Scientific Computing
2019
Closest in time.
G. Qu and N. Li, “Accelerated distributed Nesterov gradient descent,” IEEE Transactions on Automatic Control
2020
Closest in time.
G. Lan, S. Lee, and Y. Zhou, “Communication-efficient algorithms for decentralized and stochastic optimization,” Mathematical Programming
2020
Closest in time.