.png){kind=icon}
.png){kind=icon}
Return
Distributed Algorithm Over Time-Varying Unbalanced Graphs for Optimization Problem Subject to Multiple Local Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2024.3469048.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article addresses the optimization problem with its global objective function being composed of multiple convex functions under multiple nonidentical local constraints. The specific purpose is to resolve the studied optimization problem in a distributed manner in the presence of the time-varying unbalanced graph sequence. For this purpose, an efficient distributed discrete-time algorithm is developed over the time-varying unbalanced graph sequence by improving the classical push-pull algorithms. Moreover, for the developed distributed discrete-time algorithm, a rigorous analysis is made of its convergence property to the optimal solution as well as its convergence rate under some standard assumptions. Finally, numerical simulations are carried out to demonstrate the good performance of the designed algorithm.
Keywords:
Optimization
Convergence
Vectors
Directed graphs
Network systems
Linear programming
Distributed algorithms
Control systems
Numerical simulation
Standards
Distributed optimization algorithm
improved push-pull framework
multiple local constraints
time-varying unbalanced graphs
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K