Event-Triggered Zero-Gradient-Sum Distributed Constrained Optimization Over Jointly Connected Balanced Digraphs

IF 6.7 2区计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-10 DOI:10.1109/TNSE.2025.3559905

Xinli Shi;Ying Wan;Guanghui Wen;Xinghuo Yu

{"title":"Event-Triggered Zero-Gradient-Sum Distributed Constrained Optimization Over Jointly Connected Balanced Digraphs","authors":"Xinli Shi;Ying Wan;Guanghui Wen;Xinghuo Yu","doi":"10.1109/TNSE.2025.3559905","DOIUrl":null,"url":null,"abstract":"In the realm of distributed optimization (DO), it is expected to design a distributed algorithm that has a lower communication burden while handling general constraints over switching graphs. One promising approach is the zero-gradient-sum (ZGS) algorithm. However, existing ZGS-based discrete-time algorithms are limited to unconstrained DO on fixed network structures. This paper addresses this gap by first providing an event-triggered ZGS (ET-ZGS) algorithm for solving equality-constrained DO over uniformly jointly strongly connected (UJSC) and balanced digraphs. Sufficient conditions on the fixed step size are derived to guarantee the convergence for switching graphs. Specifically, when applied to fixed connected graphs, the proposed algorithm achieves linear convergence in solving equality-constrained DO with typical ET strategies; for UJSC graphs, it enables linear convergence in solving unconstrained DO. To further address inequality constraints, a distributed path-following ET-ZGS algorithm embedded with a finite-time max-consensus protocol is provided over UJSC digraphs, leveraging the barrier method akin to the interior-point method. Finally, two numerical examples are performed to verify the efficiency of the proposed algorithms.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3389-3399"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10962288/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

Abstract

In the realm of distributed optimization (DO), it is expected to design a distributed algorithm that has a lower communication burden while handling general constraints over switching graphs. One promising approach is the zero-gradient-sum (ZGS) algorithm. However, existing ZGS-based discrete-time algorithms are limited to unconstrained DO on fixed network structures. This paper addresses this gap by first providing an event-triggered ZGS (ET-ZGS) algorithm for solving equality-constrained DO over uniformly jointly strongly connected (UJSC) and balanced digraphs. Sufficient conditions on the fixed step size are derived to guarantee the convergence for switching graphs. Specifically, when applied to fixed connected graphs, the proposed algorithm achieves linear convergence in solving equality-constrained DO with typical ET strategies; for UJSC graphs, it enables linear convergence in solving unconstrained DO. To further address inequality constraints, a distributed path-following ET-ZGS algorithm embedded with a finite-time max-consensus protocol is provided over UJSC digraphs, leveraging the barrier method akin to the interior-point method. Finally, two numerical examples are performed to verify the efficiency of the proposed algorithms.

查看原文本刊更多论文

联合连接平衡有向图上事件触发的零梯度和分布约束优化

在分布式优化（DO）领域，期望设计一种具有较低通信负担的分布式算法，同时处理切换图上的一般约束。一种很有前途的方法是零梯度和（ZGS）算法。然而，现有的基于zgs的离散时间算法仅限于固定网络结构上的无约束DO。本文首先提供了一种事件触发的ZGS （ET-ZGS）算法，用于解决一致联合强连接（UJSC）和平衡有向图上的等式约束DO。给出了保证切换图收敛的步长固定的充分条件。具体而言，当应用于固定连通图时，该算法在求解等式约束DO时实现了典型ET策略的线性收敛；对于UJSC图，它可以实现求解无约束DO的线性收敛。为了进一步解决不等式约束，在UJSC有向图上提供了嵌入有限时间最大共识协议的分布式路径跟踪ET-ZGS算法，利用类似于内点方法的屏障方法。最后，通过两个算例验证了所提算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering

CiteScore

12.60

自引率

9.10%

发文量

393

期刊介绍： The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.