Cooperative distributed multi-agent optimization

Angelia Nedić, Asuman OzdaglarCambridge 2009 · DOI · OpenAlex

Abstract

This chapter presents distributed algorithms for cooperative optimization among multiple agents connected through a network. The goal is to optimize a global-objective function which is a combination of local-objective functions known by the agents only. We focus on two related approaches for the design of distributed algorithms for this problem. The first approach relies on using Lagrangian-decomposition and dual-subgradient methods. We show that this methodology leads to distributed algorithms for optimization problems with special structure. The second approach involves combining consensus algorithms with subgradient methods. In both approaches, our focus is on providing convergence-rate analysis for the generated solutions that highlight the dependence on problem parameters.
BibTeX
@inproceedings{nedic2009cooperative,
  author = {Angelia Nedić and Asuman Ozdaglar},
  title = {{Cooperative distributed multi-agent optimization}},
  booktitle = {Cambridge},
  year = {2009},
  doi = {10.1017/cbo9780511804458.011},
}

Loading related content...

Figure