A fast proximal gradient algorithm for decentralized composite optimization over directed networks

This paper proposes a fast decentralized algorithm for solving a consensus optimization problem defined in a directed networked multi-agent system, where the local objective functions have the smooth+nonsmooth composite form, and are possibly nonconvex. Examples of such problems include decentralize...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Systems & control letters Jg. 107; S. 36 - 43
Hauptverfasser:	Zeng, Jinshan, He, Tao, Wang, Mingwen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2017
Schlagworte:	Composite objective Consensus Decentralized optimization Directed network Nonconvex Decentralized optimization Directed network Composite objective Nonconvex Consensus
ISSN:	0167-6911, 1872-7956
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!