Dynamical Primal-Dual Accelerated Method with Applications to Network Optimization

arXiv1912.03690MaRDI QIDQ6330693FDOQ6330693

Authors: Xianlin Zeng, Jinlong Lei, Jie Chen 

Publication date: 8 December 2019

Abstract: This paper develops a continuous-time primal-dual accelerated method with an increasing damping coefficient for a class of convex optimization problems with affine equality constraints. This paper analyzes critical values for parameters in the proposed method and prove that the rate of convergence in terms of the duality gap function is $O(frac1t^2)$ by choosing suitable parameters. As far as we know, this is the first continuous-time primal-dual accelerated method that can obtain the optimal rate. Then this work applies the proposed method to two network optimization problems, a distributed optimization problem with consensus constraints and a distributed extended monotropic optimization problem, and obtains two variant distributed algorithms. Finally, numerical simulations are given to demonstrate the efficacy of the proposed method.

This page was built for publication: Dynamical Primal-Dual Accelerated Method with Applications to Network Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330693)