Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 2016 | Submitted
Book Section - Chapter Open

Analysis of distributed ADMM algorithm for consensus optimization in presence of error

Abstract

ADMM is a popular algorithm for solving convex optimization problems. Applying this algorithm to distributed consensus optimization problem results in a fully distributed iterative solution which relies on processing at the nodes and communication between neighbors. Local computations usually suffer from different types of errors, due to e.g., observation or quantization noise, which can degrade the performance of the algorithm. In this work, we focus on analyzing the convergence behavior of distributed ADMM for consensus optimization in presence of additive node error. We specifically show that (a noisy) ADMM converges linearly under certain conditions and also examine the associated convergence point. Numerical results are provided which demonstrate the effectiveness of the presented analysis.

Additional Information

© 2016 IEEE. Date Added to IEEE Xplore: 19 May 2016.

Attached Files

Submitted - 1901.02436v1.pdf

Files

1901.02436v1.pdf
Files (341.5 kB)
Name Size Download all
md5:547960d80fdd65c053378b89774cf463
341.5 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023