Fetching the paper…
Reading the bibliography…
We study optimal distributed first-order optimization algorithms when the network (i.e., communication constraints between the agents) changes with time.
J. M. Danskin, The Theory of Max-Min and its Applications to Weapons Allocation Problems. Springer-Verlag, 1967
1967
Earlier work this paper cites.
H. Nikaido, Convex Structures and Economic Theory. Academic Press, Cambridge, 1968
1968
Earlier work this paper cites.
V. F. Demianov and V. N. Malozemov, Introduction into Min-Max . Nauka, 1972, [in Russian]
1972
Earlier work this paper cites.
S. Boyd, P. Diaconis, and L. Xiao, “Fastest mixing markov chain on a graph,” SIAM review , vol. 46, no. 4, pp. 667–689, 2004
2004
Earlier work this paper cites.
Y. Nesterov, “Smooth minimization of non-smooth functions,” Mathematical Programming , vol. 103, no. 1, pp. 127–152, 2005
2005
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, 2009
2009
Earlier work this paper cites.
S. M. Kakade, S. Shalev-Shwartz, and A. Tewari, “On the duality of strong convexity and strong smoothness: learning applications and matrix regularization,” Toyota Technological Institute, Tech. Rep., 2009
2009
Earlier work this paper cites.
D. P. Bertsekas, Convex Optimization Theory . Athena Scientific, 2009
2009
Earlier work this paper cites.
R. Rockafellar and R. Wets, Variational analysis . Springer, 2011, vol. 317
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Y. Nesterov, Introductory Lectures on Convex Optimization. A Basic Course. Springer Science & Business Media, 2013
2013
Earlier work this paper cites.
A. Simonetto and G. Leus, “Distributed asynchronous time-varying constrained optimization,” in 2014 48th Asilomar Conference on Signals, Systems and Computers , 2014, pp. 2142–2146
2014
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast dual proximal gradient algorithm for convex minimization and applications,” Operations Research Letters , vol. 42, no. 1, pp. 1–6, 2014
2014
Cited alongside, same era.
G. Qu and N. Li, “Accelerated distributed nesterov gradient descent,” 2016 54th Annual Allerton Conference on Communication, Control, and Computing , 2016
2016
Cited alongside, same era.
M. Fazlyab, C. Nowzari, G. J. Pappas, A. Ribeiro, and V. M. Preciado, “Self-triggered time-varying convex optimization,” in 2016 IEEE 55th Conference on Decision and Control (CDC) , 2016, pp. 3090–3097
2016
Cited alongside, same era.
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 , 2017, pp. 3027–3036
2017
Cited alongside, same era.
H. Sun and M. Hong, “Distributed non-convex first-order optimization and information processing: Lower complexity bounds and rate optimal algorithms,” in 2018 52nd Asilomar Conference on Signals, Systems, and Computers , 2018, pp. 38–42
2018
Closest in time.
2018
Closest in time.
G. Zhang and R. Heusdens, “Distributed optimization using the primal-dual method of multipliers,” IEEE Transactions on Signal and Information Processing over Networks , vol. 4, no. 1, pp. 173–187, 2018
2018
Closest in time.
A. Gasnikov, “Universal gradient descent,” arXiv:1711.00394 , 2018, [in Russian]
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
X. Wu and J. Lu, “Fenchel dual gradient methods for distributed convex optimization over time-varying networks,” in 2017 IEEE 56th Annual Conference on Decision and Control (CDC) , Dec 2017, pp. 2894–2899
2017
Cited alongside, same era.
S. Rahili and W. Ren, “Distributed continuous-time convex optimization with time-varying cost functions,” IEEE Transactions on Automatic Control , vol. 62, no. 4, pp. 1590–1605, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
A. Olshevsky, “Linear time average consensus and distributed optimization on fixed graphs,” SIAM Journal on Control and Optimization , vol. 55, no. 6, pp. 3990–4014, 2017
2017
Cited alongside, same era.
K. Scaman, F. Bach, S. Bubeck, L. Massoulié, and Y. T. Lee, “Optimal algorithms for non-smooth distributed optimization in networks,” in Advances in Neural Information Processing Systems 31 , 2018, pp. 2740–2749
2018
Cited alongside, same era.
L. He, A. Bian, and M. Jaggi, “Cola: Decentralized linear learning,” in Advances in Neural Information Processing Systems 31 , 2018, pp. 4536–4546
2018
Cited alongside, same era.
2018
Cited alongside, same era.
G. Lan, S. Lee, and Y. Zhou, “Communication-efficient algorithms for decentralized and stochastic optimization,” Mathematical Programming , 2018. [Online]. Available: https://doi.org/10.1007/s10107-018-1355-4
2018
Closest in time.
2018
Closest in time.
S. Pu, W. Shi, J. Xu, and A. Nedich, “A push-pull gradient method for distributed optimization in networks,” 2018 IEEE Conference on Decision and Control (CDC) , pp. 3385–3390, 2018
2018
Closest in time.
M. Maros and J. Jaldén, “Panda: A dual linearly converging method for distributed optimization over time-varying undirected graphs,” 2018 IEEE Conference on Decision and Control (CDC) , pp. 6520–6525, 2018
2018
Closest in time.
D. Jakovetic, “A unification and generalization of exact distributed first order methods,” IEEE Transactions on Signal and Information Processing over Networks , pp. 31–46, 2019
2019
Closest in time.
T. Chen and G. B. Giannakis, “Bandit convex optimization for scalable and dynamic iot management,” IEEE Internet of Things Journal , vol. 6, no. 1, pp. 1276–1286, 2019
2019
Closest in time.
A. Bernstein, E. Dall’Anese, and A. Simonetto, “Online primal-dual methods with measurement feedback for time-varying convex optimization,” IEEE Transactions on Signal Processing , vol. 67, no. 8, pp. 1978–1991, 2019
2019
Closest in time.