Distributed min-max optimization in networks

Kunal Srivastava, Angelia Nedich, Dušan Stipanović

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We consider a setup where we are given a network of agents with their local objective functions which are coupled through a common decision variable. We provide a distributed stochastic gradient algorithm for the agents to compute an optimal decision variable that minimizes the worst case loss incurred by any agent. We establish almost sure convergence of the agent's estimates to a common optimal point. We demonstrate the use of our algorithm to a problem of min-max fair power allocation in a cellular network.

Original languageEnglish (US)
Title of host publication17th DSP 2011 International Conference on Digital Signal Processing, Proceedings
DOIs
StatePublished - 2011
Externally publishedYes
Event17th International Conference on Digital Signal Processing, DSP 2011 - Corfu, Greece
Duration: Jul 6 2011Jul 8 2011

Other

Other17th International Conference on Digital Signal Processing, DSP 2011
CountryGreece
CityCorfu
Period7/6/117/8/11

Keywords

  • Distributed network optimization
  • minmax problem
  • stochastic approximation
  • subgradient algorithm

ASJC Scopus subject areas

  • Signal Processing

Cite this

Srivastava, K., Nedich, A., & Stipanović, D. (2011). Distributed min-max optimization in networks. In 17th DSP 2011 International Conference on Digital Signal Processing, Proceedings [6004889] https://doi.org/10.1109/ICDSP.2011.6004889

Distributed min-max optimization in networks. / Srivastava, Kunal; Nedich, Angelia; Stipanović, Dušan.

17th DSP 2011 International Conference on Digital Signal Processing, Proceedings. 2011. 6004889.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Srivastava, K, Nedich, A & Stipanović, D 2011, Distributed min-max optimization in networks. in 17th DSP 2011 International Conference on Digital Signal Processing, Proceedings., 6004889, 17th International Conference on Digital Signal Processing, DSP 2011, Corfu, Greece, 7/6/11. https://doi.org/10.1109/ICDSP.2011.6004889
Srivastava K, Nedich A, Stipanović D. Distributed min-max optimization in networks. In 17th DSP 2011 International Conference on Digital Signal Processing, Proceedings. 2011. 6004889 https://doi.org/10.1109/ICDSP.2011.6004889
Srivastava, Kunal ; Nedich, Angelia ; Stipanović, Dušan. / Distributed min-max optimization in networks. 17th DSP 2011 International Conference on Digital Signal Processing, Proceedings. 2011.
@inproceedings{4edcc2140de049f0862fa2a090f255a1,
title = "Distributed min-max optimization in networks",
abstract = "We consider a setup where we are given a network of agents with their local objective functions which are coupled through a common decision variable. We provide a distributed stochastic gradient algorithm for the agents to compute an optimal decision variable that minimizes the worst case loss incurred by any agent. We establish almost sure convergence of the agent's estimates to a common optimal point. We demonstrate the use of our algorithm to a problem of min-max fair power allocation in a cellular network.",
keywords = "Distributed network optimization, minmax problem, stochastic approximation, subgradient algorithm",
author = "Kunal Srivastava and Angelia Nedich and Dušan Stipanović",
year = "2011",
doi = "10.1109/ICDSP.2011.6004889",
language = "English (US)",
isbn = "9781457702747",
booktitle = "17th DSP 2011 International Conference on Digital Signal Processing, Proceedings",

}

TY - GEN

T1 - Distributed min-max optimization in networks

AU - Srivastava, Kunal

AU - Nedich, Angelia

AU - Stipanović, Dušan

PY - 2011

Y1 - 2011

N2 - We consider a setup where we are given a network of agents with their local objective functions which are coupled through a common decision variable. We provide a distributed stochastic gradient algorithm for the agents to compute an optimal decision variable that minimizes the worst case loss incurred by any agent. We establish almost sure convergence of the agent's estimates to a common optimal point. We demonstrate the use of our algorithm to a problem of min-max fair power allocation in a cellular network.

AB - We consider a setup where we are given a network of agents with their local objective functions which are coupled through a common decision variable. We provide a distributed stochastic gradient algorithm for the agents to compute an optimal decision variable that minimizes the worst case loss incurred by any agent. We establish almost sure convergence of the agent's estimates to a common optimal point. We demonstrate the use of our algorithm to a problem of min-max fair power allocation in a cellular network.

KW - Distributed network optimization

KW - minmax problem

KW - stochastic approximation

KW - subgradient algorithm

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

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

U2 - 10.1109/ICDSP.2011.6004889

DO - 10.1109/ICDSP.2011.6004889

M3 - Conference contribution

AN - SCOPUS:80053141660

SN - 9781457702747

BT - 17th DSP 2011 International Conference on Digital Signal Processing, Proceedings

ER -