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

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on automatic control Ročník 66; číslo 10; s. 4604 - 4619
Hlavní autori:	Cannelli, Loris, Facchinei, Francisco, Scutari, Gesualdo, Kungurtsev, Vyacheslav
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!