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

Full description

Bibliographic Details

Published in:	Systems & control letters Vol. 107; pp. 36 - 43
Main Authors:	Zeng, Jinshan, He, Tao, Wang, Mingwen
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2017
Subjects:	Composite objective Consensus Decentralized optimization Directed network Nonconvex Decentralized optimization Directed network Composite objective Nonconvex Consensus
ISSN:	0167-6911, 1872-7956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!