Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Graph balancing for distributed subgradient methods over directed graphs

Graph balancing for distributed subgradient methods over directed graphs

Thumbnail Image
Download
Name

Ozdaglar_Graph balancing.pdf

Size

309.91 KB

Format

Adobe PDF

Checksum (MD5)

495a4197ca77141aba69b31c4183741c

Author(s)
Makhdoumi Kakhaki, Ali
•
Koksal, Asuman E.
Date Issued
February 2016
Journal
2015 54th IEEE Conference on Decision and Control (CDC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Makhdoumi, Ali, and Ozdaglar, Asuman. “Graph Balancing for Distributed Subgradient Methods over Directed Graphs.” 2015 54th IEEE Conference on Decision and Control (CDC), December 15-18 2015, Osaka, Japan, Institute of Electrical and Electronics Engineers (IEEE), February 2016: 1364-1371 © 2015 Institute of Electrical and Electronics Engineers (IEEE)
Version
Author's final manuscript
Abstract
We consider a multi agent optimization problem where a set of agents collectively solves a global optimization problem with the objective function given by the sum of locally known convex functions. We focus on the case when information exchange among agents takes place over a directed network and propose a distributed subgradient algorithm in which each agent performs local processing based on information obtained from his incoming neighbors. Our algorithm uses weight balancing to overcome the asymmetries caused by the directed communication network, i.e., agents scale their outgoing information with dynamically updated weights that converge to balancing weights of the graph. We show that both the objective function values and the consensus violation, at the ergodic average of the estimates generated by the algorithm, converge with rate equation, where T is the number of iterations. A special case of our algorithm provides a new distributed method to compute average consensus over directed graphs.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/111685
DOI of Published Version
https://doi.org/10.1109/CDC.2015.7402401
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.