Continuous-Time Algorithm for Approximate Distributed Optimization With Affine Equality and Convex Inequality Constraints

A distributed optimization problem (DOP) with affine equality and convex inequality constraints is studied in this article. First, the consensus constraint of the considered DOP is relaxed and a related approximate DOP (ADOP) is presented. It is proved that the optimal solutions of the ADOP (i.e., t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on systems, man, and cybernetics. Systems Ročník 51; číslo 9; s. 5809 - 5818
Hlavní autoři: Jiang, Xinrui, Qin, Sitian, Xue, Xiaoping
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.09.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Approximation algorithms
Constrained distributed optimization
Continuity (mathematics)
continuous-time algorithm
Convergence
Critical point
Directed graphs
Distributed algorithms
Linear programming
Load sharing
near-optimal solutions
Nickel
Optimization
Power systems
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í:A distributed optimization problem (DOP) with affine equality and convex inequality constraints is studied in this article. First, the consensus constraint of the considered DOP is relaxed and a related approximate DOP (ADOP) is presented. It is proved that the optimal solutions of the ADOP (i.e., the near-optimal solutions of the original DOP) are able to approach the optimal solutions of the original DOP. A continuous-time algorithm is proposed for the ADOP and it is demonstrated that the state solution of the presented algorithm converges to the critical point set of the ADOP with general locally Lipschitz continuous objective functions. This means the presented algorithm is efficient for distributed nonconvex optimization problems. Particularly, when the objective functions are convex ones, the state solution of the presented algorithm is further proved to converge to a near-optimal solution of the original DOP. One illustrative example and an application on load sharing problems are shown to validate the effectiveness of the proposed 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.2019.2957156