Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions

We consider convex and nonconvex constrained optimization with a partially separable objective function: Agents minimize the sum of local objective functions, each of which is known only by the associated agent and depends on the variables of that agent and those of a few others. This partitioned se...

Full description

Bibliographic Details

Published in:	IEEE transactions on automatic control Vol. 66; no. 10; pp. 4604 - 4619
Main Authors:	Cannelli, Loris, Facchinei, Francisco, Scutari, Gesualdo, Kungurtsev, Vyacheslav
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Asynchronous algorithms Convergence Convexity Delays error bounds Indexes Linear programming linear rate multiagent systems Nickel nonconvex optimization Optimization Partitioning algorithms
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!