A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks

References

• N.S. Aybat and E.Y. Hamedani, A primal-dual method for conic constrained distributed optimization problems, in Proc. International Conference on Neural Information Processing Systems, Barcelona, Spain, 2016, pp. 5056–5064.
   Google Scholar
• D.P. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, MA, 1999.
   Google Scholar
• J.-Y. Chen, G. Pandurangan, and D. Xu, Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis, IEEE. Trans. Parallel. Distrib. Syst. 17(9) (2006), pp. 987–1000.
   Web of Science ®Google Scholar
• O. Devolder, F. Glineur, and Y. Nesterov, Double smoothing technique for large-scale linearly constrained convex optimization, SIAM. J. Optim. 22(2) (2012), pp. 702–727.
   Web of Science ®Google Scholar
• M. Fiedler, Algebraic connectivity of graphs, Czechoslov. Math. J. 23(2) (1973), pp. 298–305.
   Web of Science ®Google Scholar
• E.Y. Hamedani and N.S. Aybat, Multi-agent constrained optimization of a strongly convex function over time-varying directed networks, in Proc. Annual Allerton Conference, Illinois, MA, 2017, pp. 518–525.
   Google Scholar
• J. Koshal, A. Nedić, and U.V. Shanbhag, Multiuser optimization: Distributed algorithms and error analysis, SIAM. J. Optim. 21(3) (2011), pp. 1046–1081.
   Web of Science ®Google Scholar
• H. Lakshmanan and D.P. de Farias, Decentralized resource allocation in dynamic networks of agents, SIAM. J. Optim. 19(2) (2008), pp. 911–940.
   Web of Science ®Google Scholar
• S. Liang, L. Wang, and G. Yin, Dual averaging push for distributed convex optimization over time-varying directed graph, IEEE. Trans. Automat. Contr. 65(4) (2020), pp. 1785–1791.
   Web of Science ®Google Scholar
• S. Liu, Z. Qu, and L. Xie, Convergence rate analysis of distributed optimization with projected subgradient algorithm, Automatica 83 (2017), pp. 162–169.
   Web of Science ®Google Scholar
• J. Lu, C.Y. Tang, P.R. Regier, and T.D. Bow, Gossip algorithms for convex consensus optimization over networks, IEEE. Trans. Automat. Contr. 56(12) (2011), pp. 2917–2923.
   Web of Science ®Google Scholar
• K. Margellos, A. Falsone, S. Garatti, and M. Prandini, Distributed constrained optimization and consensus in uncertain networks via proximal minimization, IEEE. Trans. Automat. Contr. 63(5) (2018), pp. 1372–1387.
   Web of Science ®Google Scholar
• M. Maros and J. Jaldén, A geometrically converging dual method for distributed optimization over time-varying graphs, IEEE. Trans. Automat. Contr. 66(6) (2021), pp. 2465–2479.
   Web of Science ®Google Scholar
• B. Mohar, Y. Alavi, G. Chartrand, and O. Oellermann, The Laplacian spectrum of graphs, Graph Theory Comb. Appl. 2 (1991), pp. 871–898.
   Google Scholar
• A. Nedić and A. Olshevsky, Distributed optimization over time-varying directed graphs, IEEE. Trans. Automat. Contr. 60(3) (2015), pp. 601–615.
   Web of Science ®Google Scholar
• A. Nedić and A. Olshevsky, Stochastic gradient-push for strongly convex functions on time-varying directed graphs, IEEE. Trans. Automat. Contr. 61(12) (2016), pp. 3936–3947.
   Web of Science ®Google Scholar
• A. Nedić, A. Olshevsky, and W. Shi, Achieving geometric convergence for distributed optimization over time-varying graphs, SIAM. J. Optim. 27(4) (2017), pp. 2597–2633.
   Web of Science ®Google Scholar
• A. Nedić, A. Ozdaglar, and P.A. Parrilo, Constrained consensus and optimization in multi-agent networks, IEEE. Trans. Automat. Contr. 55(4) (2010), pp. 922–938.
   Web of Science ®Google Scholar
• Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Kluwer Academic Publishers, Norwell, MA, 2004.
   Google Scholar
• C.H.J. Pang, Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting, SIAM. J. Optim. 29(1) (2019), pp. 484–510.
   Web of Science ®Google Scholar
• S. Pu, W. Shi, J. Xu, and A. Nedić, Push-pull gradient methods for distributed optimization in networks, IEEE. Trans. Automat. Contr. 66(1) (2021), pp. 1–16.
   Web of Science ®Google Scholar
• A. Rogozin, C. Uribe, A. Gasnikov, N. Malkovskii, and A. Nedić, Optimal distributed convex optimization on slowly time-varying graphs, IEEE Trans. Control. Netw. Syst. 7(2) (2020), pp. 829–841.
   Web of Science ®Google Scholar
• F. Saadatniaki, R. Xin, and U.A. Khan, Decentralized optimization over time-varying directed graphs with row and column-stochastic matrices, IEEE. Trans. Automat. Contr. 65(11) (2020), pp. 4769–4780.
   Web of Science ®Google Scholar
• G. Scutari and Y. Sun, Distributed nonconvex constrained optimization over time-varying digraphs, Math. Program. Ser. 176(1–2) (2019), pp. 497–544.
   Web of Science ®Google Scholar
• C. Uribe, S. Lee, A. Gasnikov, and A. Nedić, A dual approach for optimal algorithms in distributed optimization over networks, Optim. Methods Softw. 36(1) (2020), pp. 171–210.
   Web of Science ®Google Scholar
• X. Wu and J. Lu, Fenchel dual gradient methods for distributed convex optimization over time-varying networks, IEEE. Trans. Automat. Contr. 64(11) (2019), pp. 4629–4636.
   Web of Science ®Google Scholar
• X. Wu, K.C. Sou, and J. Lu, Fenchel dual gradient methods enabling a smoothing technique for nonsmooth distributed convex optimization, in Proc. IEEE Conference on Decision and Control, Miami, USA, 2018, pp. 1757–1762.
   Google Scholar
• L. Xiao and S. Boyd, Optimal scaling of a gradient method for distributed resource allocation, J. Optim. Theory. Appl. 129(3) (2006), pp. 469–488.
   Web of Science ®Google Scholar
• D. Yuan, Y. Hong, D.W.C. Ho, and G. Jiang, Optimal distributed stochastic mirror descent for strongly convex optimization, Automatica 90 (2018), pp. 196–203.
   Web of Science ®Google Scholar