A Finite-Time Consensus Continuous-Time Algorithm for Distributed Pseudoconvex Optimization With Local Constraints

In this article, we develop a continuous-time algorithm based on a multiagent system for solving distributed, nonsmooth, and pseudoconvex optimization problems with local convex inequality constraints. The proposed algorithm is modeled by differential inclusion, which is based on the penalty method...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on automatic control Ročník 70; číslo 2; s. 979 - 991
Hlavní autori: Wang, Sijian, Yu, Xin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.02.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Constraints
Continuous time systems
Convex functions
Distributed optimization
finite-time consensus
Heuristic algorithms
Linear programming
Multi-agent systems
Multiagent systems
Operators (mathematics)
Optimization
pseudoconvex optimization
Recurrent neural networks
Vectors
ISSN:0018-9286, 1558-2523
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this article, we develop a continuous-time algorithm based on a multiagent system for solving distributed, nonsmooth, and pseudoconvex optimization problems with local convex inequality constraints. The proposed algorithm is modeled by differential inclusion, which is based on the penalty method rather than the projection method. Compared with existing methods, the proposed algorithm has the following advantages. First, this algorithm can solve the distributed optimization problem, in which the global objective function is pseudoconvex and the local objective functions are subdifferentially regular in the global feasible region; Moreover, each agent can have different constraints. Second, this algorithm does not require exact penalty parameters or projection operators. Third, the subgradient gains for different agents may be nonuniform. Fourth, all agents reach a consensus in finite time. It is proven that under certain assumptions, from an arbitrary initial state, the solutions of all the agents will enter their local inequality feasible region and remain there, reach consensus in finite time, and converge to the optimal solution set of the primal distributed optimization problem. Numerical experiments show that the proposed algorithm is effective.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2024.3453117