Cooperative distributed multi-agent optimization

Angelia Nedich, Asuman Ozdaglar

Research output: Chapter in Book/Report/Conference proceedingChapter

82 Citations (Scopus)

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. Introduction and motivation There has been much recent interest in distributed control and coordination of networks consisting of multiple agents, where the goal is to collectively optimize a global objective. This is motivated mainly by the emergence of large-scale networks and new networking applications such as mobile ad hoc networks and wireless-sensor networks, characterized by the lack of centralized access to information and time-varying connectivity. Control and optimization algorithms deployed in such networks should be completely distributed, relying only on local observations and information, robust against unexpected changes in topology, such as link or node failures, and scalable in the size of the network. This chapter studies the problem of distributed optimization and control of multiagent networked systems. More formally, we consider a multiagent network model, where m agents exchange information over a connected network.

Original languageEnglish (US)
Title of host publicationConvex Optimization in Signal Processing and Communications
PublisherCambridge University Press
Pages340-386
Number of pages47
ISBN (Electronic)9780511804458
ISBN (Print)9780521762229
DOIs
StatePublished - Jan 1 2009
Externally publishedYes

Fingerprint

Parallel algorithms
Mobile ad hoc networks
Wireless sensor networks
Topology
Decomposition

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Nedich, A., & Ozdaglar, A. (2009). Cooperative distributed multi-agent optimization. In Convex Optimization in Signal Processing and Communications (pp. 340-386). Cambridge University Press. https://doi.org/10.1017/CBO9780511804458.011

Cooperative distributed multi-agent optimization. / Nedich, Angelia; Ozdaglar, Asuman.

Convex Optimization in Signal Processing and Communications. Cambridge University Press, 2009. p. 340-386.

Research output: Chapter in Book/Report/Conference proceedingChapter

Nedich, A & Ozdaglar, A 2009, Cooperative distributed multi-agent optimization. in Convex Optimization in Signal Processing and Communications. Cambridge University Press, pp. 340-386. https://doi.org/10.1017/CBO9780511804458.011
Nedich A, Ozdaglar A. Cooperative distributed multi-agent optimization. In Convex Optimization in Signal Processing and Communications. Cambridge University Press. 2009. p. 340-386 https://doi.org/10.1017/CBO9780511804458.011
Nedich, Angelia ; Ozdaglar, Asuman. / Cooperative distributed multi-agent optimization. Convex Optimization in Signal Processing and Communications. Cambridge University Press, 2009. pp. 340-386
@inbook{06bbd108bf99457c8f1c79cb44de58c7,
title = "Cooperative distributed multi-agent optimization",
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. Introduction and motivation There has been much recent interest in distributed control and coordination of networks consisting of multiple agents, where the goal is to collectively optimize a global objective. This is motivated mainly by the emergence of large-scale networks and new networking applications such as mobile ad hoc networks and wireless-sensor networks, characterized by the lack of centralized access to information and time-varying connectivity. Control and optimization algorithms deployed in such networks should be completely distributed, relying only on local observations and information, robust against unexpected changes in topology, such as link or node failures, and scalable in the size of the network. This chapter studies the problem of distributed optimization and control of multiagent networked systems. More formally, we consider a multiagent network model, where m agents exchange information over a connected network.",
author = "Angelia Nedich and Asuman Ozdaglar",
year = "2009",
month = "1",
day = "1",
doi = "10.1017/CBO9780511804458.011",
language = "English (US)",
isbn = "9780521762229",
pages = "340--386",
booktitle = "Convex Optimization in Signal Processing and Communications",
publisher = "Cambridge University Press",
address = "United Kingdom",

}

TY - CHAP

T1 - Cooperative distributed multi-agent optimization

AU - Nedich, Angelia

AU - Ozdaglar, Asuman

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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. Introduction and motivation There has been much recent interest in distributed control and coordination of networks consisting of multiple agents, where the goal is to collectively optimize a global objective. This is motivated mainly by the emergence of large-scale networks and new networking applications such as mobile ad hoc networks and wireless-sensor networks, characterized by the lack of centralized access to information and time-varying connectivity. Control and optimization algorithms deployed in such networks should be completely distributed, relying only on local observations and information, robust against unexpected changes in topology, such as link or node failures, and scalable in the size of the network. This chapter studies the problem of distributed optimization and control of multiagent networked systems. More formally, we consider a multiagent network model, where m agents exchange information over a connected network.

AB - 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. Introduction and motivation There has been much recent interest in distributed control and coordination of networks consisting of multiple agents, where the goal is to collectively optimize a global objective. This is motivated mainly by the emergence of large-scale networks and new networking applications such as mobile ad hoc networks and wireless-sensor networks, characterized by the lack of centralized access to information and time-varying connectivity. Control and optimization algorithms deployed in such networks should be completely distributed, relying only on local observations and information, robust against unexpected changes in topology, such as link or node failures, and scalable in the size of the network. This chapter studies the problem of distributed optimization and control of multiagent networked systems. More formally, we consider a multiagent network model, where m agents exchange information over a connected network.

UR - http://www.scopus.com/inward/record.url?scp=84926125771&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926125771&partnerID=8YFLogxK

U2 - 10.1017/CBO9780511804458.011

DO - 10.1017/CBO9780511804458.011

M3 - Chapter

AN - SCOPUS:84926125771

SN - 9780521762229

SP - 340

EP - 386

BT - Convex Optimization in Signal Processing and Communications

PB - Cambridge University Press

ER -