Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs

Distributed optimization is of essential importance in networked systems. Most of the existing distributed algorithms either assume the information exchange over undirected graphs, or require that the underlying directed network topology provides a doubly stochastic weight matrix to the agents. In t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Automatica (Oxford) Jg. 101; S. 175 - 181
Hauptverfasser:	Liang, Shu, Wang, Leyi, Yin, George
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.03.2019
Schlagworte:	Directed graph Distributed optimization Nonsmooth convex optimization Quasi-monotone subgradient algorithm Quasi-monotone subgradient algorithm Distributed optimization Nonsmooth convex optimization Directed graph
ISSN:	0005-1098, 1873-2836
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!