Distributed non-smooth resource allocation over a network
2009 (English)In: IEEE Conference on Decision and Control, 2009, 1678-1683 p.Conference paper (Refereed)
Networked systems are common and crucial. Oneof the canonical problems in such systems is distributed resourceallocation. From this rather broad class of problems, weconsider a convex non-smooth resource allocation problem witha global resource constraint. Specifically, the objective functionis separable and consists of a sum of convex functions, eachassociated with a node in a given network. Each component ofthe objective depends on a single variable local to the associatednode and the sum of all local variables must remain constantat all times. For scalability, we constrain the nodes to onlycommunicate and exchange resources with their immediateneighbors. We propose an algorithm that combines subgradientoptimization with distributed averaging. Starting the algorithmfrom a feasible point, the nodes iteratively exchange resourceswith their neighbors to get close to the optimal set whilesatisfying the total resource constraint at all times.We show thatunder mild technical conditions the algorithm converges in anepsilon-sense, as long as the stepsize is chosen sufficiently smalland the distributed averaging process is sufficiently accurate.We derive expressions for how the stepsize and the number ofconsensus iterations affect the accuracy of the final result.
Place, publisher, year, edition, pages
2009. 1678-1683 p.
IdentifiersURN: urn:nbn:se:kth:diva-79727ISI: 000336893602027ScopusID: 2-s2.0-77950831748OAI: oai:DiVA.org:kth-79727DiVA: diva2:499842
48th IEEE Conference on Decision and Control, Shanghai, P.R. China, December 16-18, 2009
QC 201202172012-02-132012-02-092015-06-10Bibliographically approved