Abstract
In this paper, the optimization problem subject to N nonidentical closed convex set constraints is studied. The aim is to design a corresponding distributed optimization algorithm over the fixed unbalanced graph to solve the considered problem. To this end, with the push-sum framework improved, the distributed optimization algorithm is newly designed, and its strict convergence analysis is given under the assumption that the involved graph is strongly connected. Finally, simulation results support the good performance of the proposed algorithm.
摘要
本文研究了带N个非一致闭凸集约束的分布式优化问题,目的是在固定的不平衡图上设计一个相应的分布式优化算法解决该问题。为此,在改进的push-sum框架下,本文设计了新的分布式优化算法,并在强连通图的假设下给出了其严格的收敛分析。最后,仿真结果证明了所提算法的良好性能。
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
The data that support the findings of this study are available from the corresponding author upon reasonable request.
References
Gharesifard B, Cortés J, 2014. Distributed continuous-time convex optimization on weight-balanced digraphs. IEEE Trans Autom Contr, 59(3):781–786. https://doi.org/10.1109/TAC.2013.2278132
Kia SS, Cortés J, Martínez S, 2015. Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication. Automatica, 55:254–264. https://doi.org/10.1016/j.automatica.2015.03.001
Liu HZ, Zheng WX, Yu W, 2021. Distributed discrete-time algorithms for convex optimization with general local constraints on weight-unbalanced digraph. IEEE Trans Contr Netw Syst, 8(1):51–64. https://doi.org/10.1109/TCNS.2020.3029996
Liu QS, Wang J, 2015. A second-order multi-agent network for bound-constrained distributed optimization. IEEE Trans Autom Contr, 60(12):3310–3315. https://doi.org/10.1109/TAC.2015.2416927
Mai VS, Abed EH, 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
Nedić A, Ozdaglar A, 2009. Distributed subgradient methods for multi-agent optimization. IEEE Trans Autom Contr, 54(1):48–61. https://doi.org/10.1109/TAC.2008.2009515
Nedić A, Olshevsky A, 2015. Distributed optimization over time-varying directed graphs. IEEE Trans Autom Contr, 60(3):601–615. https://doi.org/10.1109/TAC.2014.2364096
Nedić A, Ozdaglar A, Parrilo PA, 2010. Constrained consensus and optimization in multi-agent networks. IEEE Trans Autom Contr, 55(4):922–938. https://doi.org/10.1109/TAC.2010.2041686
Pu S, Shi W, Xu JM, et al., 2018. A push-pull gradient method for distributed optimization in networks. IEEE Conf on Decision and Control, p.3385–3390. https://doi.org/10.1109/CDC.2018.8619047
Pu S, Shi W, Xu J, et al., 2021. Push pull gradient methods for distributed optimization in networks. IEEE Trans Autom Contr, 66(1):1–16. https://doi.org/10.1109/TAC.2020.2972824
Qu GN, Li N, 2018. Harnessing smoothness to accelerate distributed optimization. IEEE Trans Contr Netw Syst, 5(3):1245–1260. https://doi.org/10.1109/TCNS.2017.2698261
Wang J, Elia N, 2011. A control perspective for centralized and distributed convex optimization. Proc 50th IEEE Conf on Decision and Control and European Control Conf, p.3800–3805. https://doi.org/10.1109/CDC.2011.6161503
Xi CG, Xin R, Khan UA, 2018. ADD-OPT: accelerated distributed directed optimization. IEEE Trans Autom Contr, 63(5):1329–1339. https://doi.org/10.1109/TAC.2017.2737582
Yang SF, Liu QS, Wang J, 2017. A multi-agent system with a proportional-integral protocol for distributed constrained optimization. IEEE Trans Autom Contr, 62(7):3461–3467. https://doi.org/10.1109/TAC.2016.2610945
Yu WW, Liu HZ, Zheng WX, Yu WW, Liu HZ, Zheng WX, et al., 2021. Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs. Automatica, 134:109899. https://doi.org/10.1016/j.automatica.2021.109899
Yuan DM, Xu SY, Zhao HY, 2011. Distributed primal-dual subgradient method for multiagent optimization via consensus algorithms. IEEE Trans Syst Man Cybern Part B Cybern, 41(6):1715–1724. https://doi.org/10.1109/TSMCB.2011.2160394
Zhu MH, Martínez S, 2012. On distributed convex optimization under inequality and equality constraints. IEEE Trans Autom Contr, 57(1):151–164. https://doi.org/10.1109/TAC.2011.2167817
Zhu YN, Yu WW, Wen GH, et al., 2019a. Continuous-time coordination algorithm for distributed convex optimization over weight–unbalanced directed networks. IEEE Trans Circ Syst II Express Briefs, 66(7):1202–1206. https://doi.org/10.1109/TCSII.2018.2878250
Zhu YN, Yu WW, Wen GH, et al., 2019b. Continuous-time distributed subgradient algorithm for convex optimization with general constraints. IEEE Trans Autom Contr, 64(4):1694–1701. https://doi.org/10.1109/TAC.2018.2852602
Zimmermann J, Tatarenko T, Willert V, et al., 2020. Projected push-sum gradient descent-ascent for convex optimization with application to economic dispatch problems. Proc 59th IEEE Conf on Decision and Control, p.542–547. https://doi.org/10.1109/CDC42340.2020.9304360
Author information
Authors and Affiliations
Contributions
Qian XU and Chutian YU designed the research. Qian XU and Xiang YUAN processed the data. Qian XU and Mengli WEI drafted the paper. Hongzhe LIU helped organize the paper. Hongzhe LIU revised and finalized the paper.
Corresponding author
Ethics declarations
Qian XU, Chutian YU, Xiang YUAN, Mengli WEI, and Hongzhe LIU declare that they have no conflict of interest.
Additional information
Project supported by the Science and Technology Project from State Grid Zhejiang Electric Power Co., Ltd., China (No. 5211JY20001Q)
Rights and permissions
About this article
Cite this article
Xu, Q., Yu, C., Yuan, X. et al. Distributed optimization based on improved push-sum framework for optimization problem with multiple local constraints and its application in smart grid. Front Inform Technol Electron Eng 24, 1253–1260 (2023). https://doi.org/10.1631/FITEE.2200596
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/FITEE.2200596