Distributed Optimization Using the Primal-Dual Method of Multipliers

Publication Type:
Journal Article
Citation:
IEEE Transactions on Signal and Information Processing over Networks, 2018, 4 (1), pp. 173 - 187
Issue Date:
2018-03-01
Filename Description Size
1702.00841v1.pdfAccepted Manuscript Version475.77 kB
Adobe PDF
Full metadata record
© 2015 IEEE. In this paper, we propose the primal-dual method of multipliers (PDMM) for distributed optimization over a graph. In particular, we optimize a sum of convex functions defined over a graph, where every edge in the graph carries a linear equality constraint. In designing the new algorithm, an augmented primal-dual Lagrangian function is constructed which smoothly captures the graph topology. It is shown that a saddle point of the constructed function provides an optimal solution of the original problem. Further under both the synchronous and asynchronous updating schemes, PDMM has the convergence rate of O(1/K) (where K denotes the iteration index) for general closed, proper, and convex functions. Other properties of PDMM such as convergence speeds versus different parameter-settings and resilience to transmission failure are also investigated through the experiments of distributed averaging.
Please use this identifier to cite or link to this item: