Distributed subgradient methods for multi-agent optimization

Angelina Nedić, Asuman Ozdaglar

Research output: Contribution to journalArticlepeer-review

2649 Scopus citations


We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimizing his/her own objective function while exchanging information locally with other agents in the network over a time-varying topology. We provide convergence results and convergence rate estimates for the subgradient method. Our convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.

Original languageEnglish (US)
Pages (from-to)48-61
Number of pages14
JournalIEEE Transactions on Automatic Control
Issue number1
StatePublished - 2009
Externally publishedYes


  • Convex optimization
  • Cooperative control
  • Distributed optimization
  • Multi-agent network
  • Subgradient method

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Distributed subgradient methods for multi-agent optimization'. Together they form a unique fingerprint.

Cite this