A Distributed Proximal Primal-Dual Algorithm for Nonsmooth Optimization with Coupling Constraints

This paper develops a novel algorithm that tackles a general distributed convex optimization problem with a nonsmooth objective function and a series of coupling nonlinear inequality and linear equality constraints. To address such a problem, we first design a distributed proximal algorithm for problems with coupling equality constraints only, and then extend this algorithm to problems with both inequality and equality constraints by incorporating a virtual-queue-based method. The resulting algorithm, referred to as Proximal Primal-Dual Algorithm (PPDA), is shown to achieve O(1/k) rates of convergence with respect to both optimality and feasibility. Compared to the alternative methods in the literature, PPDA eliminates their assumptions on the smoothness of the objective function and achieves a stronger convergence rate result. In addition, PPDA exhibits faster convergence in a couple of numerical examples.

[1]  Qing Ling,et al.  A Proximal Gradient Algorithm for Decentralized Composite Optimization , 2015, IEEE Transactions on Signal Processing.

[2]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[3]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[4]  Marc Teboulle,et al.  An $O(1/k)$ Gradient Method for Network Resource Allocation Problems , 2014, IEEE Transactions on Control of Network Systems.

[5]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[6]  Qing Ling,et al.  EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization , 2014, 1404.6264.

[7]  Bart De Schutter,et al.  Accelerated gradient methods and dual decomposition in distributed model predictive control , 2013, Autom..

[8]  Daniela Pucci de Farias,et al.  Decentralized Resource Allocation in Dynamic Networks of Agents , 2008, SIAM J. Optim..

[9]  Stephen P. Boyd,et al.  Optimal Scaling of a Gradient Method for Distributed Resource Allocation , 2006 .

[10]  Shu Liang,et al.  Distributed Dual Subgradient Algorithms With Iterate-Averaging Feedback for Convex Optimization With Coupled Constraints , 2019, IEEE Transactions on Cybernetics.

[11]  Angelia Nedic,et al.  Distributed optimization over time-varying directed graphs , 2013, 52nd IEEE Conference on Decision and Control.

[12]  Wei Shi,et al.  Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs , 2016, SIAM J. Optim..

[13]  Hao Yu,et al.  A Simple Parallel Algorithm with an O(1/t) Convergence Rate for General Convex Programs , 2015, SIAM J. Optim..

[14]  Wei Shi,et al.  Improved Convergence Rates for Distributed Resource Allocation , 2017, 2018 IEEE Conference on Decision and Control (CDC).

[15]  Shu Liang,et al.  Distributed Smooth Convex Optimization With Coupled Constraints , 2020, IEEE Transactions on Automatic Control.

[16]  Jie Lu,et al.  Fenchel Dual Gradient Methods for Distributed Convex Optimization Over Time-Varying Networks , 2017, IEEE Transactions on Automatic Control.

[17]  Anna Scaglione,et al.  Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method , 2013, IEEE Transactions on Automatic Control.

[18]  Na Li,et al.  Accelerated Distributed Nesterov Gradient Descent , 2017, IEEE Transactions on Automatic Control.