Continuous time with constraints in general directed networks distributed optimization algorithm design

被引:1
作者
Yang Z.-Q. [1 ]
Yang X.-W. [2 ]
Chen Z.-Q. [3 ]
机构
[1] College of Transportation Science and Engineering, Civil Aviation University of China, Tianjin
[2] College of Science, Civil Aviation University of China, Tianjin
[3] College of Artificial Intelligence, Nankai University, Tianjin
来源
Kongzhi Lilun Yu Yingyong/Control Theory and Applications | 2023年 / 40卷 / 06期
基金
中国国家自然科学基金;
关键词
continuous time systems; convex optimization; distributed algorithms; multi-agent systems; unbalanced directed network;
D O I
10.7641/CTA.2022.20233
中图分类号
N94 [系统科学]; C94 [];
学科分类号
0711 ; 081103 ; 1201 ;
摘要
This paper studies a class of distributed constrained optimization problems on weighted unbalanced directed networks, in which the global objective function is equal to the sum of strongly convex objective functions with the global Lipschitz gradient, and the state of each node is limited to a local constraint set. Each agent only knows its own local objective function and the non-empty constraint set. The goal of this paper is to solve the optimal solution of the problem by using a distributed method. For the optimization problem, a new distributed projection gradient continuous-time coordination algorithm is proposed, in which the imbalance of the graph is eliminated by using the left eigenvector corresponding to the zero eigenvalue of the Laplace matrix. Under some assumptions, combined with the convex analysis theory and Lyapunov stability theory, it is proved that the algorithm can obtain the optimal solution of the problem. Finally, the effectiveness of the algorithm is verified by simulations. © 2023 South China University of Technology. All rights reserved.
引用
收藏
页码:1053 / 1060
页数:7
相关论文
共 37 条
[1]  
HONG Yiguang, ZHANG Yanqiong, Distributed optimization: Algorithm design and convergence analysis, Control Theory & Applications, 31, 7, pp. 850-857, (2014)
[2]  
NEDIC A, OZDAGLAR A., Distributed subgradient methods for multi-agent optimization, IEEE Transactions on Automatic Control, 54, 1, pp. 48-61, (2009)
[3]  
NEDIC A, OZDAGLAR A, PARRILO P., Constrained consensus and optimization in multi-agent networks, IEEE Transactions on Automatic Control, 55, 4, pp. 922-938, (2010)
[4]  
ZOU Y, HUANG B, MENG Z., Distributed continuous-time algorithm for constrained optimization of networked Euler-Lagrange systems, IEEE Transactions on Control of Network Systems, 8, 2, pp. 1034-1042, (2021)
[5]  
LIU H, ZHENG W, YU W., Continuous-time algorithms based on finite-time consensus for distributed constrained convex optimization, IEEE Transactions on Automatic Control, 67, 5, pp. 2552-2559, (2021)
[6]  
PENG L, WEI R, SONG Y, Et al., Distributed optimization with the consideration of adaptivity and finite-time convergence, American Control Conference, pp. 3177-3182, (2014)
[7]  
LU K, JING G, WANG L., Online distributed optimization with strongly pseudoconvex-sum cost functions, IEEE Transactions on Automatic Control, 65, 1, pp. 426-433, (2019)
[8]  
LONG Yushan, LIU Shuai, XIE Lihua, Distributed stochastic convex optimization with set constraints, Chinese Science: Mathematics, 46, 10, pp. 1487-1498, (2016)
[9]  
ZHU M, MARTINEZ S., On distributed convex optimization under inequality and equality constraints, IEEE Transactions on Automatic Control, 57, 1, pp. 151-164, (2012)
[10]  
WANG J, ELIA N., A control perspective for centralized and distributed convex optimization, IEEE Conference on Decision and Control and European Control Conference, pp. 3800-3805, (2011)