Distributed optimization algorithms based on predefined-time convergence

被引：0
|
作者：
Yang T. [1 ]
Chang Y.-R. [1 ]
Zhang K.-P. [1 ]
Xu L. [1 ]
机构：
[1] The State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang
来源：
Kongzhi yu Juece/Control and Decision | 2023年 / 38卷 / 08期
关键词：
distributed optimization; predefined-time convergence; proportional-integral algorithm; restricted strongly convex; time-based generator;
D O I：
10.13195/j.kzyjc.2023.0391
中图分类号：
学科分类号：
摘要：
This paper studies a class of distributed optimization problems, which aims to minimize the global cost function consisting of the sum of local cost functions through local information exchanges. For this class of problems, by introducing a time-based generator (TBG)，the paper proposes two distributed proportional-integral (PI) optimization algorithms based on predefined-time convergence. Compared to existing distributed optimization algorithms based on finite/fixed time convergence, the convergence time of the proposed algorithms does not depend on initial values and parameters of the system and it can be arbitrarily predefined. Furthermore, the proposed algorithms can converge within a predefined time based on the Lyapunov theory under the conditions that the global cost function is restricted strongly convex with respect to the global optimal point along with local cost functions being convex, differentiable, and having local Lipschitz gradient. Finally, the effectiveness of these two algorithms is verified by numerical simulation. © 2023 Northeast University. All rights reserved.
引用
收藏
页码：2364 / 2374
页数：10
相关论文
共 39 条
  • [1] Tsitsiklis J N., Problems in decentralized decision making and computation, pp. 147-152, (1984)
  • [2] Tsitsiklis J N, Bertsekas D, Athans M., Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Transactions on Automatic Control, 31, 9, pp. 803-812, (1986)
  • [3] Yang T, Lu J, Wu D, Et al., A distributed algorithm for economic dispatch over time-varying directed networks with delays, IEEE Transactions on Industrial Electronics, 64, 6, pp. 5095-5106, (2017)
  • [4] Hong M Y, Hajinezhad D, Zhao M M., Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks[C], Proceedings of the 34th International Conference on Machine Learning, pp. 1529-1538, (2017)
  • [5] Boyd S, Parikh N, Chu E, Et al., Distributed optimization and statistical learning via the alternating direction method of multipliers, in Machine Learning, 3, 1, pp. 1-122, (2011)
  • [6] Zheng Y L, Liu Q S., A review of distributed optimization: Problems, models and algorithms, Neurocomputing, 483, 1, pp. 446-459, (2022)
  • [7] Yang T, Yi X L, Wu J F, Et al., A survey of distributed optimization, Annual Reviews in Control, 47, pp. 278-305, (2019)
  • [8] Chen W S., Theory and method of distributed optimization and learning, pp. 15-18, (2019)
  • [9] Yi P, Hong Y G., Distributed cooperative optimization and its applications, Scientia Sinica: Mathematica, 46, 10, pp. 1547-1564, (2016)
  • [10] Yang T, Chai T Y., Research status and prospects of distributed collaborative optimization, Scientia Sinica: Technologica, 50, 11, pp. 1413-1425, (2020)
1234