Exponential convergence of distributed primal–dual convex optimization algorithm without strong convexity

This paper establishes exponential convergence rates for a class of primal–dual gradient algorithms in distributed optimization without strong convexity. The convergence analysis is based on a carefully constructed Lyapunov function. By evaluating metric subregularity of the primal–dual gradient map...

Celý popis

Podrobná bibliografie

Vydáno v:	Automatica (Oxford) Ročník 105; s. 298 - 306
Hlavní autoři:	Liang, Shu, Wang, Le Yi, Yin, George
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.07.2019
Témata:	Convex optimization without strong convexity Distributed optimization Exponential convergence Metric subregularity Primal–dual algorithm Rate of convergence Variational analysis Exponential convergence Metric subregularity Variational analysis Distributed optimization Convex optimization without strong convexity Rate of convergence Primal–dual algorithm
ISSN:	0005-1098, 1873-2836
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!