A distributed dynamical solver for an optimal resource allocation problem over networked systems

In this paper, we consider an optimal resource allocation problem over networked systems where the global cost function is a sum of local convex cost functions of the agents. This optimization problem is subject to an affine equality constraint which represents the demand that the agents should meet...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2015 54th IEEE Conference on Decision and Control (CDC) s. 7482 - 7487
Hlavný autor:	Kia, Solmaz S.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2015
Predmet:	Algorithm design and analysis Convex functions Distributed algorithms Heuristic algorithms Optimization Radio frequency Resource management
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	In this paper, we consider an optimal resource allocation problem over networked systems where the global cost function is a sum of local convex cost functions of the agents. This optimization problem is subject to an affine equality constraint which represents the demand that the agents should meet through weighted contribution of their cost variables. We propose a novel distributed continuous-time algorithm that solves the problem over networks with connected graph communication topology. We also present an extension of our algorithm to solve allocation problems subject to multiple affine constraints. We demonstrate our results through a numerical example.
DOI:	10.1109/CDC.2015.7403401