Distributed Prediction-Correction ADMM for Time-Varying Convex Optimization

Abstract

This paper introduces a dual-regularized ADMM approach to distributed, time-varying optimization. The proposed algorithm is designed in a prediction-correction framework, in which the computing nodes predict the future local costs based on past observations, and exploit this information to solve the time-varying problem more effectively. In order to guarantee linear convergence of the algorithm, a regularization is applied to the dual, yielding a dual-regularized ADMM. We analyze the convergence properties of the time-varying algorithm, as well as the regularization error of the dual-regularized ADMM. Numerical results show that in time-varying settings, despite the regularization error, the performance of the dual-regularized ADMM can outperform inexact gradient-based methods, as well as exact dual decomposition techniques, in terms of asymptotical error and consensus constraint violation.

arXiv commentPresented at Asilomar Conference on Signals, Systems, and Computers 2020

References in corpus (9)

• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• Distributed Convex Optimization for Continuous-Time Dynamics with Time-Varying Cost Function
• ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates
• Prediction-Correction Algorithms for Time-Varying Constrained Optimization
• Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
• Optimization and Learning with Information Streams: Time-varying Algorithms and Applications
• Can Primal Methods Outperform Primal-dual Methods in Decentralized Dynamic Optimization?
• tvopt: A Python Framework for Time-Varying Optimization
• A Prediction-Correction Algorithm for Real-Time Model Predictive Control