Fetching the paper…
Reading the bibliography…
This paper proposes a novel exact distributed asynchronous subgradient-push algorithm (AsySPA) to solve an additive cost optimization problem over directed graphs where each node only has access to a local convex function and updates asynchronously with an arbitrary rate.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” IEEE Transactions on Automatic Control , vol. 31, no. 9, pp. 803–812, 1986
1986
Earlier work this paper cites.
S. Li and T. Başar, “Asymptotic agreement and convergence of asynchronous stochastic algorithms,” IEEE Transactions on Automatic Control , vol. 32, no. 7, pp. 612–618, 1987
1987
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48–61, 2009
2009
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Convergence rate for consensus with delays,” Journal of Global Optimization , vol. 47, no. 3, pp. 437–456, 2010
2010
Earlier work this paper cites.
A. Nedić, “Asynchronous broadcast-based convex optimization over a network,” IEEE Transactions on Automatic Control , vol. 56, no. 6, pp. 1337–1351, 2011
2011
Earlier work this paper cites.
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, “Push-sum distributed dual averaging for convex optimization,” in 51st IEEE Conference on Decision and Control , Dec 2012, pp. 5453–5458
2012
Earlier work this paper cites.
K. Cai and H. Ishii, “Average consensus on general strongly connected digraphs,” Automatica , vol. 48, no. 11, pp. 2750–2761, 2012
2012
Earlier work this paper cites.
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 , 2013, pp. 551–554
2013
Earlier work this paper cites.
Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer Science & Business Media, 2013, vol. 87
2013
Earlier work this paper cites.
A. Priolo, A. Gasparri, E. Montijano, and C. Sagues, “A distributed algorithm for average consensus on strongly connected weighted digraphs,” Automatica , vol. 50, no. 3, pp. 946–951, 2014
2014
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Athena Scientific, 2015
2015
Earlier work this paper cites.
A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” IEEE Transactions on Automatic Control , vol. 60, no. 3, pp. 601–615, 2015
2015
Earlier work this paper cites.
W. Shi, Q. Ling, G. Wu, and W. Yin, “Extra: An exact first-order algorithm for decentralized consensus optimization,” SIAM Journal on Optimization , vol. 25, no. 2, pp. 944–966, 2015
2015
Earlier work this paper cites.
X. Zhao and A. H. Sayed, “Asynchronous adaptation and learning over networks-Part I: Modeling and stability analysis,” IEEE Transactions on Signal Processing , vol. 63, no. 4, pp. 811–826, 2015
2015
Earlier work this paper cites.
H. Wang, X. Liao, T. Huang, and C. Li, “Cooperative distributed optimization in multiagent networks with delays,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 45, no. 2, pp. 363–369, 2015
2015
Earlier work this paper cites.
D. P. Bertsekas, Convex Optimization Algorithms . Athena Scientific Belmont, 2015
2015
Earlier work this paper cites.
J. M. Hendrickx and J. N. Tsitsiklis, “Fundamental limitations for anonymous distributed systems with broadcast communications,” in 53rd Annual Allerton Conference on Communication, Control, and Computing . IEEE, 2015, pp. 9–16
2015
Earlier work this paper cites.
P. Bianchi, W. Hachem, and F. Iutzeler, “A coordinate descent primal-dual algorithm and application to distributed asynchronous optimization,” IEEE Transactions on Automatic Control , vol. 61, no. 10, pp. 2947–2957, 2016
2016
Earlier work this paper cites.
Z. Peng, Y. Xu, M. Yan, and W. Yin, “Arock: an algorithmic framework for asynchronous parallel coordinate updates,” SIAM Journal on Scientific Computing , vol. 38, no. 5, pp. A2851–A2879, 2016
2016
Cited alongside, same era.
P. Lin, W. Ren, and Y. Song, “Distributed multi-agent optimization subject to nonidentical constraints and communication delays,” Automatica , vol. 65, pp. 120–131, 2016
2016
Cited alongside, same era.
Y. Sun, G. Scutari, and D. Palomar, “Distributed nonconvex multiagent optimization over time-varying networks,” in 50th Asilomar Conference on Signals, Systems and Computers , 2016, pp. 788–794
2016
Cited alongside, same era.
A. Nedic, A. Olshevsky, and C. A. Uribe, “Distributed Gaussian learning over time-varying directed graphs,” in 50th Asilomar Conference on Signals, Systems and Computers , Nov 2016, pp. 1710–1714
2016
Cited alongside, same era.
S. Magnússon, C. Enyioha, N. Li, C. Fischione, and V. Tarokh, “Convergence of limited communications gradient methods,” IEEE Transactions on Automatic Control , vol. 63, no. 5, pp. 1356–1371, 2018
2018
Closest in time.
P. Xie, K. You, R. Tempo, S. Song, and C. Wu, “Distributed convex optimization with inequality constraints over time-varying unbalanced digraphs,” IEEE Transactions on Automatic Control , vol. 63, no. 12, pp. 4331–4337, 2018
2018
Closest in time.
F. Farina, A. Garulli, A. Giannitrapani, and G. Notarstefano, “Asynchronous distributed method of multipliers for constrained nonconvex optimization,” in 2018 European Control Conference (ECC) . IEEE, 2018, pp. 2535–2540
2018
Closest in time.
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Convergence of asynchronous distributed gradient methods over stochastic networks,” IEEE Transactions on Automatic Control , vol. 63, no. 2, pp. 434–448, 2018
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Assran and M. Rabbat, “An empirical comparison of multi-agent optimization algorithms,” in IEEE Global Conference on Signal and Information Processing , 2017, pp. 573–577
2017
Cited alongside, same era.
C. Xi and U. A. Khan, “Dextra: A fast algorithm for optimization over directed graphs,” IEEE Transactions on Automatic Control , vol. 62, no. 10, pp. 4980–4993, 2017
2017
Cited alongside, same era.
A. Nedić, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,” SIAM Journal on Optimization , vol. 27, no. 4, pp. 2597–2633, 2017
2017
Cited alongside, same era.
I. Notarnicola and G. Notarstefano, “Asynchronous distributed optimization via randomized dual proximal gradient,” IEEE Transactions on Automatic Control , vol. 62, no. 5, pp. 2095–2106, 2017
2017
Cited alongside, same era.
M. Eisen, A. Mokhtari, and A. Ribeiro, “Decentralized quasi-newton methods,” IEEE Transactions on Signal Processing , vol. 65, no. 10, pp. 2613–2628, 2017
2017
Cited alongside, same era.
T. T. Doan, C. L. Beck, and R. Srikant, “On the convergence rate of distributed gradient methods for finite-sum optimization under communication delays,” Proceedings of the ACM on Measurement and Analysis of Computing Systems , vol. 1, no. 2, pp. 37:1–37:27, 2017
2017
Cited alongside, same era.
T. Yang, J. Lu, D. Wu, J. Wu, G. Shi, Z. Meng, and K. H. Johansson, “A distributed algorithm for economic dispatch over time-varying directed networks with delays,” IEEE Transactions on Industrial Electronics , vol. 64, no. 6, pp. 5095–5106, 2017
2017
Cited alongside, same era.
D. Dheeru and E. Karra Taniskidou, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
T. Wu, K. Yuan, Q. Ling, W. Yin, and A. H. Sayed, “Decentralized consensus optimization with asynchrony and delays,” IEEE Transactions on Signal and Information Processing over Networks , vol. 4, no. 2, pp. 293–307, 2018
2018
Closest in time.
X. Lian, W. Zhang, C. Zhang, and J. Liu, “Asynchronous decentralized parallel stochastic gradient descent,” in Proceedings of the 35th Conference on Machine Learning , 2018, pp. 3049–3058
2018
Closest in time.
Y. Tian, Y. Sun, and G. Scutari, “ASY-SONATA: Achieving linear convergence in distributed asynchronous multiagent optimization,” in 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . IEEE, 2018, pp. 543–551
2018
Closest in time.
P. Xie, K. You, Y. Hong, and L. Xie, “A survey of distributed convex optimization algorithms over networks,” Control Theory & Applications , vol. 35, no. 7, pp. 918–927, 2018
2018
Closest in time.
R. Xin and U. A. Khan, “A linear algorithm for optimization over directed graphs with geometric convergence,” IEEE Control Systems Letters , vol. 2, no. 3, pp. 325–330, 2018
2018
Closest in time.
C. Xi, R. Xin, and U. A. Khan, “Add-opt: Accelerated distributed directed optimization,” IEEE Transactions on Automatic Control , vol. 63, no. 5, pp. 1329–1339, 2018
2018
Closest in time.
2018
Closest in time.
R. Hannah, F. Feng, and W. Yin, “A2BCD: Asynchronous acceleration with optimal complexity,” in International Conference on Learning Representations , 2019. [Online]. Available: https://openreview.net/forum?id=rylIAsCqYm
2019
Closest in time.
J. Zhang, K. You, and T. Başar, “Distributed discrete-time optimization in multi-agent networks using only sign of relative state,” IEEE Transactions on Automatic Control , vol. 64, no. 6, pp. 2352–2367, 2019
2019
Closest in time.
N. Bof, R. Carli, G. Notarstefano, L. Schenato, and D. Varagnolo, “Multiagent newton–raphson optimization over lossy networks,” IEEE Transactions on Automatic Control , vol. 64, no. 7, pp. 2983–2990, July 2019
2019
Closest in time.
L. Cannelli, F. Facchinei, V. Kungurtsev, and G. Scutari, “Asynchronous parallel algorithms for nonconvex optimization,” Mathematical Programming , 2019
2019
Closest in time.
P. R. Johnstone and P. Moulin, “Faster subgradient methods for functions with hölderian growth,” Mathematical Programming , 2019
2019
Closest in time.