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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 59; číslo 5; s. 1131 - 1146
Hlavní autori:	Jakovetic, Dusan, Xavier, Joao, Moura, Jose M. F.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.05.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!