Distributed Primal-Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms

This paper studies the problem of optimizing the sum of multiple agents' local convex objective functions, subject to global convex inequality constraints and a convex state constraint set over a network. Through characterizing the primal and dual optimal solutions as the saddle points of the L...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on systems, man and cybernetics. Part B, Cybernetics Ročník 41; číslo 6; s. 1715 - 1724
Hlavní autoři: Deming Yuan, Shengyuan Xu, Huanyu Zhao
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States IEEE 01.12.2011
Témata:
Algorithm design and analysis
Approximation algorithms
Average consensus
Convergence
Convex functions
convex optimization
distributed optimization
Lagrangian functions
Optimization
subgradient method
Upper bound
ISSN:1083-4419, 1941-0492
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í:This paper studies the problem of optimizing the sum of multiple agents' local convex objective functions, subject to global convex inequality constraints and a convex state constraint set over a network. Through characterizing the primal and dual optimal solutions as the saddle points of the Lagrangian function associated with the problem, we propose a distributed algorithm, named the distributed primal-dual subgradient method, to provide approximate saddle points of the Lagrangian function, based on the distributed average consensus algorithms. Under Slater's condition, we obtain bounds on the convergence properties of the proposed method for a constant step size. Simulation examples are provided to demonstrate the effectiveness of the proposed method.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1083-4419
1941-0492
DOI:10.1109/TSMCB.2011.2160394