Fetching the paper…
Reading the bibliography…
This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication.
S. A. Geršgorin, “Über die abgrenzung der eigenwerte einer mmatrix,” Bulletin de l’Académie des Sciences de l’URSS. Classe des sciences mathématiques et na , no. 6, pp. 749–754, 1931
1931
Earlier work this paper cites.
P. Erdos and A. Renyi, “On random graphs i,” Publ. Math. Debrecen , vol. 6, pp. 290–297, 1959
1959
Earlier work this paper cites.
J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” in 1984 American Control Conference , 1984, pp. 484–489
1984
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Prentice hall Englewood Cliffs, NJ, 1989, vol. 23
1989
Earlier work this paper cites.
D. P. Bertsekas, Nonlinear programming . Athena scientific, 1999
1999
Earlier work this paper cites.
R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proceedings of the IEEE , vol. 95, no. 1, pp. 215–233, Jan 2007
2007
Earlier work this paper cites.
B. Johansson, “On distributed optimization in networked systems,” 2008
2008
Earlier work this paper cites.
I. Lobel and A. Ozdaglar, “Convergence analysis of distributed subgradient methods over random networks,” in Communication, Control, and Computing, 2008 46th Annual Allerton Conference on . IEEE, 2008, pp. 353–360
2008
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” Automatic Control, IEEE Transactions on , vol. 54, no. 1, pp. 48–61, 2009
2009
Earlier work this paper cites.
A. Olshevsky and J. N. Tsitsiklis, “Convergence speed in distributed consensus and averaging,” SIAM Journal on Control and Optimization , vol. 48, no. 1, pp. 33–55, 2009
2009
Earlier work this paper cites.
J. A. Bazerque and G. B. Giannakis, “Distributed spectrum sensing for cognitive radio networks by exploiting sparsity,” IEEE Transactions on Signal Processing , vol. 58, no. 3, pp. 1847–1862, 2010
2010
Earlier work this paper cites.
P. A. Forero, A. Cano, and G. B. Giannakis, “Consensus-based distributed support vector machines,” Journal of Machine Learning Research , vol. 11, no. May, pp. 1663–1707, 2010
2010
Earlier work this paper cites.
S. S. Ram, A. Nedić, and V. V. Veeravalli, “Distributed stochastic subgradient projection algorithms for convex optimization,” Journal of optimization theory and applications , vol. 147, no. 3, pp. 516–545, 2010
2010
Earlier work this paper cites.
I. Matei and J. S. Baras, “Performance evaluation of the consensus-based distributed subgradient method under random communication topologies,” Selected Topics in Signal Processing, IEEE Journal of , vol. 5, no. 4, pp. 754–771, 2011
2011
Earlier work this paper cites.
I. Lobel, A. Ozdaglar, and D. Feijer, “Distributed multi-agent optimization with state-dependent communication,” Mathematical Programming , vol. 129, no. 2, pp. 255–284, 2011
2011
Earlier work this paper cites.
E. Wei and A. Ozdaglar, “Distributed alternating direction method of multipliers,” in Decision and Control (CDC), 2012 IEEE 51st Annual Conference on . IEEE, 2012, pp. 5445–5450
2012
Earlier work this paper cites.
J. C. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: convergence analysis and network scaling,” Automatic control, IEEE Transactions on , vol. 57, no. 3, pp. 592–606, 2012
2012
Earlier work this paper cites.
M. Zhu and S. Martínez, “On distributed convex optimization under inequality and equality constraints,” Automatic Control, IEEE Transactions on , vol. 57, no. 1, pp. 151–164, 2012
2012
Cited alongside, same era.
I.-A. Chen et al. , “Fast distributed first-order methods,” Master’s thesis, Massachusetts Institute of Technology, 2012
2012
Cited alongside, same era.
A. I. Chen and A. Ozdaglar, “A fast distributed proximal-gradient method,” in Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on . IEEE, 2012, pp. 601–608
2012
Cited alongside, same era.
R. A. Horn and C. R. Johnson, Matrix analysis . Cambridge university press, 2012
2012
Cited alongside, same era.
(2012) Logistic regression. [Online]. Available: http://www.stat.cmu.edu/ cshalizi/uADA/12/lectures/ch12.pdf
2012
Cited alongside, same era.
P. Di Lorenzo and G. Scutari, “Distributed nonconvex optimization over networks,” in Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2015 IEEE 6th International Workshop on . IEEE, 2015, pp. 229–232
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
P. Di Lorenzo and G. Scutari, “Next: In-network nonconvex optimization,” IEEE Transactions on Signal and Information Processing over Networks , vol. 2, no. 2, pp. 120–136, 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…
Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer Science & Business Media, 2013, vol. 87
2013
Cited alongside, same era.
O. Devolder, F. Glineur, Y. Nesterov et al. , “First-order methods with inexact oracle: the strongly convex case,” CORE Discussion Papers , vol. 2013016, 2013
2013
Cited alongside, same era.
W. Shi, Q. Ling, K. Yuan, G. Wu, and W. Yin, “On the linear convergence of the admm in decentralized consensus optimization.” IEEE Trans. Signal Processing , vol. 62, no. 7, pp. 1750–1761, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
D. Jakovetic, J. Xavier, and J. M. Moura, “Fast distributed gradient methods,” Automatic Control, IEEE Transactions on , vol. 59, no. 5, pp. 1131–1146, 2014
2014
Cited alongside, same era.
O. Devolder, F. Glineur, and Y. Nesterov, “First-order methods of smooth convex optimization with inexact oracle,” Mathematical Programming , vol. 146, no. 1-2, pp. 37–75, 2014
2014
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
——, “Add-opt: Accelerated distributed directed optimization,” arXiv preprint arXiv:1607.04757 , 2016
2016
Later among the works it cites.
G. Qu and N. Li, “Accelerated distributed nesterov gradient descent for smooth and strongly convex functions,” in Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton Conference on . IEEE, 2016, pp. 209–216
2016
Later among the works it cites.
2017
Closest in time.
2017
Closest in time.
Z. Allen-Zhu, “Katyusha: The first direct acceleration of stochastic gradient methods,” in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing . ACM, 2017, pp. 1200–1205
2017
Closest in time.
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.
2018
Closest in time.
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,” in 2015 54th IEEE Conference on Decision and Control (CDC) . IEEE, 2015, pp. 2055–2060
2060
Closest in time.