On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems

In this paper we propose a fully distributed dual gradient algorithm for minimizing linearly constrained separable convex problems and analyze its rate of convergence. In particular, we prove that under the assumption of strong convexity and Lipschitz continuity of the gradient of the primal objecti...

Full description

Bibliographic Details

Published in:	Automatica (Oxford) Vol. 55; pp. 209 - 216
Main Authors:	Necoara, Ion, Nedelcu, Valentin
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.05.2015
Subjects:	Distributed gradient algorithm Dual decomposition Error bound Linear convergence Separable convex problems Dual decomposition Separable convex problems Error bound Linear convergence Distributed gradient algorithm
ISSN:	0005-1098, 1873-2836
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!