Distributed primal-dual method on unbalanced digraphs with row stochasticity

References

• Adachi, T., Hayashi, N., & Takai, S. (2021). Distributed gradient descent method with edge-based event-driven communication for non-convex optimisation. IET Control Theory & Applications, 15(12), 1588–1598. https://doi.org/10.1049/cth2.v15.12
   Web of Science ®Google Scholar
• Cao, X., & Başar, T. (2020). Decentralized multi-agent stochastic optimization with pairwise constraints and quantized communications. IEEE Transactions on Signal Processing, 68, 3296–3311. https://doi.org/10.1109/TSP.78
   Web of Science ®Google Scholar
• Chang, T. H., Nedić, A., & Scaglione, A. (2014). Distributed constrained optimization by consensus-based primal-dual perturbation method. IEEE Transactions on Automatic Control, 59(6), 1524–1538. https://doi.org/10.1109/TAC.9
   Web of Science ®Google Scholar
• Falsone, A., Notarnicola, I., Notarstefano, G., & Prandini, M. (2020). Tracking-ADMM for distributed constraint-coupled optimization. Automatica, 117, Article 108962. https://doi.org/10.1016/j.automatica.2020.108962
   Web of Science ®Google Scholar
• Hayashi, N., Sugiura, T., Kajiyama, Y., & Takai, S. (2020). Distributed event-triggered algorithm for unconstrained convex optimization over weight-balanced directed networks. IET Control Theory & Applications, 14(2), 253–261. https://doi.org/10.1049/cth2.v14.2
   Web of Science ®Google Scholar
• Ikeda, T., Sakurama, K., & Kashima, K. (2022). Multiple sparsity constrained control node scheduling with application to rebalancing of mobility networks. IEEE Transactions on Automatic Control, 67(8), 4314–4321. https://doi.org/10.1109/TAC.2021.3115441
   Web of Science ®Google Scholar
• Kajiyama, Y., Hayashi, N., & Takai, S. (2018). Distributed subgradient method with edge-based event-triggered communication. IEEE Transactions on Automatic Control, 63(7), 2248–2255. https://doi.org/10.1109/TAC.2018.2800760
   Web of Science ®Google Scholar
• Kajiyama, Y., Hayashi, N., & Takai, S. (2021). Linear convergence of consensus-based quantized optimization for smooth and strongly convex cost functions. IEEE Transactions on Automatic Control, 66(3), 1254–1261. https://doi.org/10.1109/TAC.9
   Web of Science ®Google Scholar
• Li, H., Liu, S., Soh, Y. C., & Xie, L. (2018). Event-triggered communication and data rate constraint for distributed optimization of multiagent systems. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 48(11), 1908–1919. https://doi.org/10.1109/TSMC.2017.2694323
   Web of Science ®Google Scholar
• Li, H., Lü, Q., Chen, G., Huang, T., & Dong, Z. Y. (2021). Distributed constrained optimization over unbalanced directed networks using asynchronous broadcast-based algorithm. IEEE Transactions on Automatic Control, 66(3), 1102–1115. https://doi.org/10.1109/TAC.9
   Web of Science ®Google Scholar
• Li, H., Lü, Q., Liao, X., & Huang, T. (2020). Accelerated convergence algorithm for distributed constrained optimization under time-varying general directed graphs. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(7), 2612–2622. https://doi.org/10.1109/TSMC.6221021
   Web of Science ®Google Scholar
• Li, M., Chesi, G., & Hong, Y. (2021). Input-feedforward-passivity-based distributed optimization over jointly connected balanced digraphs. IEEE Transactions on Automatic Control, 66(9), 4117–4131. https://doi.org/10.1109/TAC.2020.3028838
   Web of Science ®Google Scholar
• Li, X., Feng, G., & Xie, L. (2021). Distributed proximal algorithms for multi-agent optimization with coupled inequality constraints. IEEE Transactions on Automatic Control, 66(3), 1223–1230. https://doi.org/10.1109/TAC.9
   Web of Science ®Google Scholar
• Lin, P., Ren, W., & Song, Y. (2016). Distributed multi-agent optimization subject to nonidentical constraints and communication delays. Automatica, 65, 120–131. https://doi.org/10.1016/j.automatica.2015.11.014
   Web of Science ®Google Scholar
• Lorenzo, P. D., & Scutari, G. (2016). NEXT: In-network nonconvex optimization. IEEE Transactions on Signal and Information Processing over Networks, 2(2), 120–136. https://doi.org/10.1109/TSIPN.2016.2524588
   Web of Science ®Google Scholar
• Lou, Y., Yu, L., Wang, S., & Yi, P. (2017). Privacy preservation in distributed subgradient optimization algorithms. IEEE Transactions on Cybernetics.48(7), 2154–2165.. https://doi.org/10.1109/TCYB.2017.2728644
   PubMed Web of Science ®Google Scholar
• Mai, V. S., & Abed, E. H. (2019). Distributed optimization over directed graphs with row stochasticity and constraint regularity. Automatica, 102, 94–104. https://doi.org/10.1016/j.automatica.2018.07.020
   Web of Science ®Google Scholar
• Mateos-Núñez, D., & Cortés, J. (2017). Distributed saddle-point subgradient algorithms with Laplacian averaging. IEEE Transactions on Automatic Control, 62(6), 2720–2735. https://doi.org/10.1109/TAC.2016.2616646
   Web of Science ®Google Scholar
• Nedić, A., Olshevsky, A., & Rabbat, M. G. (2018). Network topology and communication-computation tradeoffs in decentralized optimization. Proceedings of the IEEE, 106(5), 953–976. https://doi.org/10.1109/JPROC.2018.2817461
   Web of Science ®Google Scholar
• Nedić, A., Ozdaglar, A., & Parrilo, P. A. (2010). Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control, 55(4), 922–938. https://doi.org/10.1109/TAC.2010.2041686
   Web of Science ®Google Scholar
• Qu, G., & Li, N. (2018). Harnessing smoothness to accelerate distributed optimization. IEEE Transactions on Control of Network Systems, 5(3), 1245–1260. https://doi.org/10.1109/TCNS.2017.2698261
   Web of Science ®Google Scholar
• Sakuma, H., Hayashi, N., & Takai, S. (2021). Distributed primal-dual perturbation algorithm over unbalanced directed networks. IEEE Access, 9, 75324–75335. https://doi.org/10.1109/ACCESS.2021.3082537
   Web of Science ®Google Scholar
• Tatarenko, T., & Touri, B. (2017). Non-convex distributed optimization. IEEE Transactions on Automatic Control, 62(8), 3744–3757. https://doi.org/10.1109/TAC.2017.2648041
   Web of Science ®Google Scholar
• Vlaski, S., & Sayed, A. H. (2021). Distributed learning in non-convex environments—Part I: Agreement at a linear rate. IEEE Transactions on Signal Processing, 69, 1242–1256. https://doi.org/10.1109/TSP.78
   Web of Science ®Google Scholar
• Wang, X., Yang, S., Guo, Z., & Huang, T. (2021). A second-order projected primal-dual dynamical system for distributed optimization and learning. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/TNNLS.2021.3127883
   Web of Science ®Google Scholar
• Wang, Y., & Poor, H. V. (2022). Decentralized stochastic optimization with inherent privacy protection. IEEE Transactions on Automatic Control. https://doi.org/10.1109/TAC.2022.3174187
   Web of Science ®Google Scholar
• Xi, C., & Khan, U. A. (2016). Distributed subgradient projection algorithm over directed graphs. IEEE Transactions on Automatic Control, 62(8), 3986–3992. https://doi.org/10.1109/TAC.2016.2615066
   Web of Science ®Google Scholar
• Xie, P., You, K., Tempo, R., Song, S., & Wu, C. (2018). Distributed convex optimization with inequality constraints over time-varying unbalanced digraphs. IEEE Transactions on Automatic Control, 63(12), 4331–4337. https://doi.org/10.1109/TAC.2018.2816104
   Web of Science ®Google Scholar
• Yamashita, M., Hayashi, N., Hatanaka, T., & Takai, S. (2021). Logarithmic regret for distributed online subgradient method over unbalanced directed networks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E104-A(8), 1019–1026. https://doi.org/10.1587/transfun.2020EAP1111
   Web of Science ®Google Scholar
• Yamashita, S., Hatanaka, T., Yamauchi, J., & Fujita, M. (2020). Passivity-based generalization of primal-dual dynamics for non-strictly convex cost functions. Automatica, 112, Article 108712. https://doi.org/10.1016/j.automatica.2019.108712
   Web of Science ®Google Scholar
• Yang, Q., & Chen, G. (2019). Primal-dual subgradient algorithm for distributed constraint optimization over unbalanced digraphs. IEEE Access, 7, 85190–85202. https://doi.org/10.1109/Access.6287639
   Web of Science ®Google Scholar
• Yang, T., Lu, J., Wu, D., Wu, J., Shi, G., Meng, Z., & Johansson, K. H. (2017). A distributed algorithm for economic dispatch over time-varying directed networks with delays. IEEE Transactions on Industrial Electronics, 64(6), 5095–5106. https://doi.org/10.1109/TIE.2016.2617832
   Web of Science ®Google Scholar
• Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & K. H. Johansson (2019). A survey of distributed optimization. Annual Reviews in Control, 47, 278–305. https://doi.org/10.1016/j.arcontrol.2019.05.006
   Web of Science ®Google Scholar
• Yi, P., & Hong, Y. (2014). Quantized subgradient algorithm and data-rate analysis for distributed optimization. IEEE Transactions on Control of Network Systems, 1(4), 380–392. https://doi.org/10.1109/TCNS.2014.2357513
   Google Scholar
• Yuan, D., Xu, S., Zhang, B., & Rong, L. (2013). Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints. International Journal of Robust and Nonlinear Control, 23(16), 1846–1868. https://doi.org/10.1002/rnc.2856
   Web of Science ®Google Scholar
• Zhu, M., & Martínez, S. (2011). On distributed convex optimization under inequality and equality constraints. IEEE Transactions on Automatic Control, 57(1), 151–164. https://doi.org/10.1109/TAC.2011.2167817
   Web of Science ®Google Scholar
• Zimmermann, J., Tatarenko, T., Willert, V., & Adamy, J. (2020). Projected push-sum gradient descent-ascent for convex optimization with application to economic dispatch problems. In Proceedings of the 59th IEEE annual conference on decision and control (pp. 542–547).
   Google Scholar