AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs

This paper proposes a novel exact asynchronous subgradient-push algorithm (AsySPA) to solve an additive cost optimization problem over digraphs where each node only has access to a local convex function and updates asynchronously with an arbitrary rate. Specifically, each node of a strongly connecte...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 65; no. 6; pp. 2494 - 2509
Main Authors:	Zhang, Jiaqi, You, Keyou
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Asynchronous subgradient-push algorithm (AsySPA) Clocks Computational geometry Computer simulation Convergence Convex functions Convexity Delays Distributed algorithms distributed optimization problem (DOP) even update rates (EUR) Graph theory Nodes Optimization Synchronization uneven update rates (UUR)
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!