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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on automatic control Jg. 66; H. 10; S. 4604 - 4619
Hauptverfasser:	Cannelli, Loris, Facchinei, Francisco, Scutari, Gesualdo, Kungurtsev, Vyacheslav
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.10.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!