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
A multi-agent projected dual gradient method with primal convergence guarantees
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.
2013 (English)In: 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, IEEE conference proceedings, 2013, 275-281 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider a class of multi-agent optimization problems, where each agent is endowed with a strongly convex (but not necessarily differentiable) loss function and is subject to individual constraints composed of linear equalities, convex inequalities, and convex set constraints. We derive a novel algorithm that allows the agents to collaboratively reach a decision that minimizes the sum of the loss functions over the intersection of the individual constraints. The algorithm is based on a projected dual gradient technique and exploits the structure of the individual constraint sets to avoid costly projections. A convergence rate analysis shows that the primal iterates produced by individual agents under our algorithm converge to the primal optimal solution at a rate that is superior to alternatives in the literature. Finally, we provide a thorough comparison of our algorithm with alternatives in terms of both theoretical and algorithmic aspects.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 275-281 p.
Keyword [en]
Algorithmic aspects, Constraint set, Convergence rates, Individual agent, Linear equality, Novel algorithm, Optimization problems, Primal optimal solutions, Communication, Gradient methods, Set theory, Algorithms
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-146930DOI: 10.1109/Allerton.2013.6736535ISI: 000350802400039Scopus ID: 2-s2.0-84897741610ISBN: 978-147993409-6 (print)OAI: oai:DiVA.org:kth-146930DiVA: diva2:726927
Conference
51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013; Monticello, IL; United States; 2 October 2013 through 4 October 2013
Funder
Swedish Research CouncilSwedish Foundation for Strategic Research
Note

QC 20140619

Available from: 2014-06-19 Created: 2014-06-18 Last updated: 2015-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lu, JieJohansson, Mikael
By organisation
ACCESS Linnaeus CentreAutomatic Control
Other Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 36 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