作者: Tsung-Hui Chang
DOI: 10.1109/ICASSP.2015.7178630
关键词:
摘要: Recently, the alternating direction method of multipliers (ADMM) has been used for distributed consensus optimization and is shown to converge faster than conventional approaches based on subgradient. In this paper, we consider a convex problem with linearly coupled equality constraint employ dual ADMM (DC-ADMM) solving in fully fashion. particular, by considering non-ideal network where agents can be ON OFF randomly communications among fail probabilistically, propose randomized DC-ADMM that robust against these effects. Moreover, show proposed provably convergent an optimal solution worst-case O(1/k) convergence rate, k iteration number. Simulation results are presented examine practical behavior presence ON/OFF communication links.