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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 64; H. 4; S. 1694 - 1701
Hauptverfasser:	Zhu, Yanan, Yu, Wenwu, Wen, Guanghui, Chen, Guanrong, Ren, Wei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!