Fetching the paper…
Reading the bibliography…
Recently, there has been significant progress in the development of distributed first order methods.
H. Uzawa, “Iterative methods in concave programming,” 1958, in Arrow, K., Hurwicz, L., Uzawa, H. (eds.) Studies in Linear and Nonlinear Programming, pp. 154-165. Stanford University Press, Stanford
1958
Earlier work this paper cites.
Y. E. Nesterov, “A method for solving the convex programming problem with convergence rate O ( 1 / k 2 ) (1/k^{2}) ,” Dokl. Akad. Nauk SSSR , vol. 269, pp. 543–547, 1983, (in Russian)
1983
Earlier work this paper cites.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” IEEE Trans. Autom. Contr. , vol. 31, no. 9, pp. 803–812, Sep. 1986
1986
Earlier work this paper cites.
M. Kallio and C. H. Rosa, “Large-scale convex optimization via saddle-point computation,” Oper. Res. , pp. 93–101, 1999
1999
Earlier work this paper cites.
M. Rabbat and R. Nowak, “Distributed optimization in sensor networks,” in IPSN 2004, 3rd International Symposium on Information Processing in Sensor Networks , Berkeley, California, USA, April 2004, pp. 20 – 27
2004
Earlier work this paper cites.
C. Lopes and A. H. Sayed, “Adaptive estimation algorithms over distributed networks,” in 21st IEICE Signal Processing Symposium , Kyoto, Japan, Nov. 2006
2006
Earlier work this paper cites.
I. Lobel and A. Ozdaglar, “Convergence analysis of distributed subgradient methods over random networks,” in 46th Annual Allerton Conference onCommunication, Control, and Computing , Monticello, Illinois, September 2008, pp. 353 – 360
2008
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48–61, January 2009
2009
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Subgradient methods for saddle point problems,” Journal of Optimization Theory and Applications , vol. 145, no. 1, pp. 205–228, July 2009
2009
Earlier work this paper cites.
C. Desoer and M. Vidyasagar, Feedback Systems: Input-Output Properties . SIAM, 2009
2009
Earlier work this paper cites.
F. Cattivelli and A. H. Sayed, “Diffusion LMS strategies for distributed estimation,” IEEE Trans. Sig. Process. , vol. 58, no. 3, pp. 1035–1048, March 2010
2010
Earlier work this paper cites.
A. Nedic, A. Ozdaglar, and A. Parrilo, “Constrained consensus and optimization in multi-agent networks,” IEEE Transactions on Automatic Control , vol. 55, no. 4, pp. 922–938, April 2010
2010
Earlier work this paper cites.
J. Wang and N. Elia, “Control approach to distributed optimization,” in 48th Annual Allerton Conference onCommunication, Control, and Computing , Monticello, IL, Oct. 2010
2010
Earlier work this paper cites.
A. Dimakis, S. Kar, J. M. F. Moura, M. Rabbat, and A. Scaglione, “Gossip algorithms for distributed signal processing,” Proceedings of the IEEE , vol. 98, no. 11, pp. 1847–1864, 2010
2010
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning, Michael Jordan, Editor in Chief , vol. 3, no. 1, pp. 1–122, 2011
2011
Cited alongside, same era.
M. Schmidt, N. L. Roux, and F. Bach, “Convergence rates of inexact proximal-gradient methods for convex optimization,” in Advances in Neural Information Processing Systems 24 , 2011, pp. 1458–1466
2011
Cited alongside, same era.
J. Duchi, A. Agarwal, and M. Wainwright, “Dual averaging for distributed optimization: Convergence and network scaling,” IEEE Trans. Aut. Contr. , vol. 57, no. 3, pp. 592–606, March 2012
2012
Cited alongside, same era.
S. Kar, J. M. F. Moura, and K. Ramanan, “Distributed parameter estimation in sensor networks: Nonlinear observation models and imperfect communication,” IEEE Transactions on Information Theory , vol. 58, no. 6, pp. 3575–3605, June 2012
2012
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Mokhtari and A. Ribeiro, “DSA: Decentralized double stochastic averaging gradient algorithm,” Journal of Machine Learning Research , vol. 17, pp. 1–35, 2016
2016
Later among the works it cites.
D. Jakovetic, D. Bajovic, N. Krejic, and N. K. Jerinkic, “Distributed gradient methods with variable number of working nodes,” IEEE Transactions on Signal Processing , vol. 64, no. 15, pp. 4080–4095, August 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
M. Zhu and S. Martinez, “On distributed convex optimization under inequality and equality constraints,” IEEE Transactions on Automatic Control , vol. 57, no. 1, pp. 151–164, Jan. 2012
2012
Cited alongside, same era.
A. H. Sayed, S.-Y. Tu, J. Chen, X. Zhao, and Z. Towfic, “Diffusion strategies for adaptation and learning over networks,” IEEE Sig. Process. Mag. , vol. 30, no. 3, pp. 155–171, May 2013
2013
Cited alongside, same era.
D. Jakovetic, J. Xavier, and J. M. F. Moura, “Fast distributed gradient methods,” IEEE Trans. Autom. Contr. , vol. 59, no. 5, pp. 1131–1146, May 2014
2014
Cited alongside, same era.
——, “Convergence rates of distributed Nesterov-like gradient methods on random networks,” IEEE Transactions on Signal Processing , vol. 62, no. 4, pp. 868–882, February 2014
2014
Cited alongside, same era.
T.-H. Chang, A. Nedic, and A. Scaglione, “Distributed constrained optimization by consensus-based primal-dual perturbation method,” IEEE Transactions on Automatic Control , vol. 59, no. 6, pp. 1524–1538, June 2014
2014
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “EXTRA: An exact first-order algorithm for decentralized consensus optimization,” SIAM J. Optim. , vol. 25, no. 2, pp. 944–966, 2015
2015
Cited alongside, same era.
D. Jakovetic, J. Xavier, and J. M. F. Moura, “Linear convergence rate of a class of distributed augmented Lagrangian algorithms,” IEEE Trans. Autom. Contr. , vol. 60, no. 4, pp. 922–936, April 2015
2015
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “A proximal gradient algorithm for decentralized composite optimization,” Journal of Machine Learning Research , vol. 63, no. 22, pp. 6013–6023, 2015
2015
Cited alongside, same era.
K. Yuan, Q. Ling, and W. Yin, “On the convergence of decentralized gradient descent,” SIAM J. Optim. , vol. 26, no. 3, pp. 1835–1854, 2016
2016
Later among the works it cites.
G. Qu and N. Li, “Harnessing smoothness to accelerate distributed optimization,” to appear in IEEE Transactions on Control of Network Systems , 2017, DOI: 10.1109/TCNS.2017.2698261
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
C. Xi and U. A. Khan, “Dextra: A fast algorithm for optimization over directed graphs,” IEEE Transactions on Automatic Control , 2017, to appear, DOI: 10.1109/TAC.2017.2672698
2017
Closest in time.
J. Zeng and W. Yin, “Extrapush for convex smooth decentralized optimization over directed networks,” Journal of Computational Mathematics , vol. 35, no. 4, pp. 381–394, 2017
2017
Closest in time.
2017
Closest in time.
J. Xu, S. Zhu, Y. Soh, and L. Xie, “Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,” in 54th IEEE Conference on Decision and Control (CDC) , 2015, pp. 2055–2060
2060
Closest in time.