Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Distributed non-smooth resource allocation over a network
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
2009 (English)In: IEEE Conference on Decision and Control, 2009, 1678-1683 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-79727ISI: 000336893602027Scopus ID: 2-s2.0-77950831748OAI: oai:DiVA.org:kth-79727DiVA: diva2:499842
Conference
48th IEEE Conference on Decision and Control, Shanghai, P.R. China, December 16-18, 2009
Note

QC 20120217

Available from: 2012-02-13 Created: 2012-02-09 Last updated: 2015-06-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Scopushttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5400558

Search in DiVA

By author/editor
Johansson, BjörnJohansson, Mikael
By organisation
Automatic ControlACCESS Linnaeus Centre
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf