.png){kind=icon}
.png){kind=icon}
Return
Time-varying distributed optimization problem with inequality constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2023.08.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper discusses a distributed time-varying convex optimization problem that agents have different Hessian matrices with inequality constraints. The objective is to minimize the sum of local time-varying objective functions of agents constrained by time-varying inequalities. Under the condition of undirected connected graph, a distributed continuous time consistency algorithm is designed based on average consensus estimator, sign function and log-barrier penalty function. The main idea of the algorithm proposed in this paper is to use the estimator to estimate the global information, make the state of agents reach consensus and achieve gradient descent to track the optimal solution. Theoretical findings show that all agents can reach an agreement, the proposed algorithm can track the optimal solution of the time-varying optimization problem. The effectiveness of the theoretical results is verified through a numerical examples. (c) 2023 Published by Elsevier Inc. on behalf of The Franklin Institute.
Keywords:
CONSENSUS PROBLEMS
ALGORITHM
NETWORKS
Journal
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W