A Continuous-Time Algorithm for Distributed Optimization Based on Multiagent Networks

Based on the multiagent networks, this paper introduces a continuous-time algorithm to deal with distributed convex optimization. Using nonsmooth analysis and algebraic graph theory, the distributed network algorithm is modeled by the aid of a nonautonomous differential inclusion, and each agent exc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on systems, man, and cybernetics. Systems Ročník 49; číslo 12; s. 2700 - 2709
Hlavní autoři: He, Xing, Huang, Tingwen, Yu, Junzhi, Li, Chaojie, Zhang, Yushu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithm design and analysis
Algorithms
Computational geometry
Computer networks
Continuous-time algorithm
Convex functions
Convexity
distributed optimization
Economics
Graph theory
Heuristic algorithms
Laplace equations
multiagent network
Multiagent systems
Optimization
State variable
Topology
Traveling salesman problem
ISSN:2168-2216, 2168-2232
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Based on the multiagent networks, this paper introduces a continuous-time algorithm to deal with distributed convex optimization. Using nonsmooth analysis and algebraic graph theory, the distributed network algorithm is modeled by the aid of a nonautonomous differential inclusion, and each agent exchanges information from the first-order and the second-order neighbors. For any initial point, the solution of the proposed network can reach consensus to the set of minimizers if the graph has a spanning tree. In contrast to the existing continuous-time algorithms for distributed optimization, the proposed model holds the least number of state variables and relaxes the strongly connected weighted-balanced topology to the weaker case. The modified form of the proposed continuous-time algorithm is also given, and it is proven that this algorithm is suitable for solving distributed problems if the undirected network is connected. Finally, two numerical examples and an optimal placement problem confirm the effectiveness of the proposed continuous-time algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2168-2216
2168-2232
DOI:10.1109/TSMC.2017.2780194