Analysis of distributed ADMM algorithm for consensus optimisation over lossy networks. Issue 6 (1st August 2018)

• Record Type: Journal Article
• Authors: Majzoobi, Layla; Shah‐Mansouri, Vahid; Lahouti, Farshad
• Is Part Of: IET signal processing. Volume 12:Issue 6(2018)
• Page Start: 786
• Page End: 794
• Publication Date: 2018-08-01
• Subjects: computational complexity -- convex programming -- distributed algorithms; distributed ADMM algorithm -- lossy network -- consensus optimisation problem -- network connectivity -- alternating direction method of multipliers -- convex optimisation algorithm -- computational resource requirements -- computational complexity -- storage requirements; Signal processing -- Periodicals; 621.3822
• DOI: 10.1049/iet-spr.2018.0033
• Languages: English
• ISSNs: 1751-9675

Abstract

Abstract : Alternating direction method of multipliers (ADMM) is a popular convex optimisation algorithm, which is implemented in a distributed manner. Applying this algorithm to consensus optimisation problem, where a number of agents cooperatively try to solve an optimisation problem using locally available data, leads to a fully distributed algorithm which relies on local computations and communication between neighbours. In this study, the authors analyse the convergence of the distributed ADMM algorithm for solving a consensus optimisation problem over a lossy network, whose links are subject to failure. They present and analyse two different distributed ADMM‐based algorithms. The algorithms are different in their network connectivity, storage and computational resource requirements. The first one converges over a sequence of networks which are not the same but remains connected over all iterations. The second algorithm is convergent over a sequence of different networks whose union is connected. The former algorithm, compared to the latter, has lower computational complexity and storage requirements. Numerical experiments confirm the proposed theoretical analysis.