Fast Distributed Gradient Methods

We study distributed optimization problems when N nodes minimize the sum of their individual costs subject to a common vector variable. The costs are convex, have Lipschitz continuous gradient (with constant L), and bounded gradient. We propose two fast distributed gradient algorithms based on the c...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 59; no. 5; pp. 1131 - 1146
Main Authors:	Jakovetic, Dusan, Xavier, Joao, Moura, Jose M. F.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.05.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Acceleration Algorithm design and analysis Algorithms Consensus Constants Convergence convergence rate Costs distributed optimization Educational institutions Errors Gradient methods Mathematical analysis Nesterov gradient Optimization Syntax Vectors
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!