Decentralized Prediction-Correction Methods for Networked Time-Varying Convex Optimization
Decentralized Prediction-Correction Methods for Networked Time-Varying Convex Optimization
复制标题
DOI:
10.1109/tac.2017.2694611
复制
发表时间:
2016-02
影响因子:
6.8
通讯作者:
Andrea Simonetto;Alec Koppel;Aryan Mokhtari;G. Leus;Alejandro Ribeiro
中科院分区:
文献类型:
--
作者:
Andrea Simonetto;Alec Koppel;Aryan Mokhtari;G. Leus;Alejandro Ribeiro
We develop algorithms that find and track the optimal solution trajectory of time-varying convex optimization problems that consist of local and network-related objectives. The algorithms are derived from the prediction-correction methodology, which corresponds to a strategy where the time-varying problem is sampled at discrete time instances, and then, a sequence is generated via alternatively executing predictions on how the optimizers at the next time sample are changing and corrections on how they actually have changed. Prediction is based on how the optimality conditions evolve in time, while correction is based on a gradient or Newton method, leading to decentralized prediction-correction gradient and decentralized prediction-correction Newton. We extend these methods to cases where the knowledge on how the optimization programs are changing in time is only approximate and propose decentralized approximate prediction-correction gradient and decentralized approximate prediction-correction Newton. Convergence properties of all the proposed methods are studied and empirical performance is shown on an application of a resource allocation problem in a wireless network. We observe that the proposed methods outperform existing running algorithms by orders of magnitude. The numerical results showcase a tradeoff between convergence accuracy, sampling period, and network communications.