Distributed Algorithm for Robust Resource Allocation with Polyhedral Uncertain Allocation Parameters

This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the (nonsmooth) objective function is a sum of local convex objective functions a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of systems science and complexity Ročník 31; číslo 1; s. 103 - 119
Hlavní autoři: Zeng, Xianlin, Yi, Peng, Hong, Yiguang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Academy of Mathematics and Systems Science, Chinese Academy of Sciences 01.02.2018
Springer Nature B.V
Témata:
Algorithms
Complex Systems
Computational geometry
Control
Convexity
Economic models
Mathematics
Mathematics and Statistics
Mathematics of Computing
Multiagent systems
Operations Research/Decision Theory
Optimization
Optimization algorithms
Parameter uncertainty
Resource allocation
Robustness
Statistics
Systems Theory
polyhedral uncertain parameters
Distributed optimization
resource allocation
nonsmooth optimization
robust optimization
ISSN:1009-6124, 1559-7067
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the (nonsmooth) objective function is a sum of local convex objective functions assigned to agents in a multi-agent network. Each agent has a private feasible set and decides a local variable, and all the local variables are coupled with a global affine inequality constraint, which is subject to polyhedral uncertain parameters. With the duality theory of convex optimization, the authors derive a robust counterpart of the robust resource allocation problem. Based on the robust counterpart, the authors propose a novel distributed continuous-time algorithm, in which each agent only knows its local objective function, local uncertainty parameter, local constraint set, and its neighbors’ information. Using the stability theory of differential inclusions, the authors show that the algorithm is able to find the optimal solution under some mild conditions. Finally, the authors give an example to illustrate the efficacy of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1009-6124
1559-7067
DOI:10.1007/s11424-018-7145-5