Quantized Consensus ADMM for Multi-Agent Distributed Optimization
arXiv:1510.08736 · doi:10.1109/ICASSP.2016.7472455
Abstract
Multi-agent distributed optimization over a network minimizes a global objective formed by a sum of local convex functions using only local computation and communication. We develop and analyze a quantized distributed algorithm based on the alternating direction method of multipliers (ADMM) when inter-agent communications are subject to finite capacity and other practical constraints. While existing quantized ADMM approaches only work for quadratic local objectives, the proposed algorithm can deal with more general objective functions (possibly non-smooth) including the LASSO. Under certain convexity assumptions, our algorithm converges to a consensus within iterations, where depends on the local objectives and the network topology, and is a polynomial determined by the quantization resolution, the distance between initial and optimal variable values, the local objective functions and the network topology. A tight upper bound on the consensus error is also obtained which does not depend on the size of the network.
30 pages, 4 figures; to be submitted to IEEE Trans. Signal Processing. arXiv admin note: text overlap with arXiv:1307.5561 by other authors
References in corpus (4)
Cited by in corpus (8)
- Distributed Discrete-time Optimization in Multi-agent Networks Using only Sign of Relative State
- Quantized Consensus ADMM for Multi-Agent Distributed Optimization
- GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning
- Privacy-preserving Incremental ADMM for Decentralized Consensus Optimization
- Distributed ADMM with Synergetic Communication and Computation
- COKE: Communication-Censored Decentralized Kernel Learning
- Optimized Quantization in Distributed Graph Signal Filtering
- New results on multi-agent system consensus: A graph signal processing perspective