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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Systems & control letters Ročník 107; s. 36 - 43
Hlavní autoři: Zeng, Jinshan, He, Tao, Wang, Mingwen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.09.2017
Témata:
Composite objective
Consensus
Decentralized optimization
Directed network
Nonconvex
Decentralized optimization
Directed network
Composite objective
Nonconvex
Consensus
ISSN:0167-6911, 1872-7956
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 decentralized compressed sensing and constrained quadratic programming problems, as well as many decentralized regularization problems. We extend the existing algorithms PG-EXTRA and ExtraPush to a new algorithm PG-ExtraPush for composite consensus optimization over a directed network. This algorithm takes advantage of the proximity operator like in PG-EXTRA to deal with the nonsmooth term, and employs the push-sum protocol like in ExtraPush to tackle the bias introduced by the directed network. With a proper step size, we show that PG-ExtraPush converges to an optimal solution at a linear rate under some regular assumptions. We conduct a series of numerical experiments to show the effectiveness of the proposed algorithm. Specifically, with a proper step size, PG-ExtraPush performs linear rates in most of cases, even in some nonconvex cases, and is significantly faster than Subgradient-Push, even if the latter uses a hand-optimized step size. The established theoretical results are also verified by the numerical results.
ISSN:0167-6911
1872-7956
DOI:10.1016/j.sysconle.2017.07.005