Distributed Fast-Tracking Alternating Direction Method of Multipliers (ADMM) Algorithm with Optimal Convergence Rate

• Published in: Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics pp. 976 - 981
• Main Authors: Shethia, Shreyansh, Gupta, Akshita, Thapliyal, Omanshu, Hwang, Inseok
• Format: Conference Proceeding
• Language: English
• Published: IEEE 17.10.2021
• Subjects: Convex functions; Network topology; Prediction algorithms; Programming; Real-time systems; Trajectory; Upper bound
• ISSN: 2577-1655
• DOI: 10.1109/SMC52423.2021.9658615

In this paper, we consider a distributed optimization problem with coupled constraints, where a network of agents aim to cooperatively minimize the sum of their local objective functions, subject to individual constraints. The primary goal is to improve the convergence rate of the existing Tracking Alternating Direction Method of Multipliers (TADMM) algorithm to solve the above distributed optimization problem. To this end, an upper bound on the convergence rate factor of the TADMM algorithm is derived in terms of the weight matrix of the network. To achieve faster convergence, the optimal weight matrix is computed using a semi-definite programming (SDP) formulation. Lastly, we implement the optimization problem in a Distributed Model-Predictive Control problem for a group of aircraft in formation flight and solve it using both Fast-Tracking ADMM (F-TADMM) and TADMM to demonstrate faster convergence of the proposed algorithm.