Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks

In this paper, we develop randomized block-coordinate descent methods for minimizing multi-agent convex optimization problems with linearly coupled constraints over networks and prove that they obtain in expectation an ε accurate solution in at most O(1/λ 2 (Q)ϵ) iterations, where λ 2 (Q) is the sec...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on automatic control Ročník 58; číslo 8; s. 2001 - 2012
Hlavný autor:	Necoara, Ion
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.08.2013
Predmet:	Algorithm design and analysis Convergence Convex functions Distributed control Eigenvalues and eigenfunctions Linear programming linearly coupled constraints Optimization random coordinate descent rate of convergence resource allocation problems smooth convex optimization 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!