https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Decentralized_Multi-Agent_Optimization_via_Dual_Decomposition 2026-05-25T00:58:05Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Decentralized_Multi-Agent_Optimization_via_Dual_Decomposition&diff=20292&oldid=prev 2016-05-20T08:17:38Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 08:17, 20 May 2016</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td> <td colspan="2" class="diff-lineno">Line 1:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>{{HTDB paper</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>{{HTDB paper</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| authors = <del style="font-weight: bold; text-decoration: none;">Ha </del>Terelius, Ufuk Topcu, Richard M Murray</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| authors = <ins style="font-weight: bold; text-decoration: none;">Håkan </ins>Terelius, Ufuk Topcu, Richard M Murray</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| title = Decentralized Multi-Agent Optimization via Dual Decomposition</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| title = Decentralized Multi-Agent Optimization via Dual Decomposition</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| source = IFAC World Congress, 2011 (Submitted)</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| source = IFAC World Congress, 2011 (Submitted)</div></td></tr> </table>

Murray https://murray.cds.caltech.edu/index.php?title=Decentralized_Multi-Agent_Optimization_via_Dual_Decomposition&diff=19767&oldid=prev 2016-05-15T06:16:14Z

<p>htdb2wiki: creating page for 2010k_ttm11-ifac.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Ha Terelius, Ufuk Topcu, Richard M Murray<br /> | title = Decentralized Multi-Agent Optimization via Dual Decomposition<br /> | source = IFAC World Congress, 2011 (Submitted)<br /> | year = 2010<br /> | type = Preprint<br /> | funding = <br /> | url = http://www.cds.caltech.edu/~murray/preprints/ttm11-ifac_s.pdf<br /> | abstract = We study a distributed multi-agent optimization problem of minimizing the sum of convex objective functions. A new decentralized optimization algorithm is introduced, based on dual decomposition, together with the subgradient method for finding the optimal solution. The iterative algorithm is implemented on a multi-hop network and is designed to handle communication delays. The convergence of the algorithm is proved for communication networks with bounded delays. An explicit bound, which depends on the communication delays, on the convergence rate is given. A numerical comparison with a decentralized primal algorithm shows that the dual algorithm converges faster, with less communication.<br /> | flags = <br /> | tag = ttm11-ifac<br /> | id = 2010k<br /> }}</div>

Murray