Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints

The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an optimization problem, a new type of continuous-time distributed subgradient optimization algorithm is proposed based on the Karuch-Kuhn-Tucker condition...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 64; číslo 4; s. 1694 - 1701
Hlavní autori:	Zhu, Yanan, Yu, Wenwu, Wen, Guanghui, Chen, Guanrong, Ren, Wei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.04.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Computational geometry Computer simulation Continuous-time subgradient algorithm Convergence Convex analysis Convex functions Convexity distributed convex optimization Hierarchies Indexes Linear programming Multi-agent systems multiagent systems nonsmooth analysis Optimization Protocols Signal processing algorithms
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!

Buďte prvý, kto okomentuje tento záznam!