Computational Convergence Analysis of Distributed Optimization Algorithms for Directed Graphs

In this paper, we present a unified framework based on integral quadratic constraints for analyzing the convergence of distributed push-pull based optimization algorithms for directed graphs. Our framework provides numerical upper bounds on linear convergence rates of existing distributed push-pull...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE International Conference on Control and Automation (Print) s. 1096 - 1101
Hlavní autori:	Zhang, Shengjun, Yi, Xinlei, George, Jemin, Yang, Tao
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.07.2019
Predmet:	Automation Convergence Directed graphs Linear programming Optimization Upper bound
ISSN:	1948-3457
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!