Skip to main content
Article
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
IEEE Transactions on Signal Processing
  • Tsung-Hui Chang, National Taiwan University of Science and Technology
  • Mingyi Hong, Iowa State University
  • Xiangfeng Wang, East China Normal University
Document Type
Article
Publication Version
Submitted Manuscript
Publication Date
1-1-2015
DOI
10.1109/TSP.2014.2367458
Abstract

Multi-agent distributed consensus optimization problems arise in many signal processing applications. Recently, the alternating direction method of multipliers (ADMM) has been used for solving this family of problems. ADMM based distributed optimization method is shown to have faster convergence rate compared with classic methods based on consensus subgradient, but can be computationally expensive, especially for problems with complicated structures or large dimensions. In this paper, we propose lowcomplexity algorithms that can reduce the overall computational cost of consensus ADMM by an order of magnitude for certain large-scale problems. Central to the proposed algorithms is the use of an inexact step for each ADMM update, which enables the agents to perform cheap computation at each iteration. Our convergence analyses show that the proposed methods converge well under some convexity assumptions. Numerical results show that the proposed algorithms offer considerably lower computational complexity than the standard ADMM based distributed optimization methods.

Comments

This is a manuscript of an article from IEEE Transactions on Signal Processing 63 (2015):482, doi: 10.1109/TSP.2014.2367458. Posted with permission.

Copyright Owner
IEEE
Language
en
Date Available
2015-06-16
File Format
application/pdf
Citation Information
Tsung-Hui Chang, Mingyi Hong and Xiangfeng Wang. "Multi-Agent Distributed Optimization via Inexact Consensus ADMM" IEEE Transactions on Signal Processing Vol. 63 Iss. 2 (2015) p. 482 - 497
Available at: http://works.bepress.com/mingyi_hong/14/