A Simple Parallel Algorithm with an O(1/t) Convergence Rate for General Convex Programs

This paper considers convex programs with a general (possibly non-differentiable) convex objective function and Lipschitz continuous convex inequality constraint functions. A simple algorithm is developed and achieves an $O(1/t)$ convergence rate. Similar to the classical dual subgradient algorithm and the ADMM algorithm, the new algorithm has a parallel implementation when the objective and constraint functions are separable. However, the new algorithm has a faster $O(1/t)$ convergence rate compared with the best known $O(1/\sqrt{t})$ convergence rate for the dual subgradient algorithm with primal averaging. Further, it can solve convex programs with nonlinear constraints, which cannot be handled by the ADMM algorithm. The new algorithm is applied to a multipath network utility maximization problem and yields a decentralized flow control algorithm with the fast $O(1/t)$ convergence rate.

[1]  Michael J. Neely,et al.  A Simple Convergence Time Analysis of Drift-Plus-Penalty for Stochastic Optimization and Convex Programs , 2014, 1412.0791.

[2]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[3]  Bingsheng He,et al.  On the O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method , 2012, SIAM J. Numer. Anal..

[4]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

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

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

[7]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[8]  Asuman E. Ozdaglar,et al.  On the O(1=k) convergence of asynchronous distributed alternating Direction Method of Multipliers , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[9]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[10]  Stephen P. Boyd,et al.  Proximal Algorithms , 2013, Found. Trends Optim..

[11]  Asuman E. Ozdaglar,et al.  Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods , 2008, SIAM J. Optim..

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  Hao Yu,et al.  On the convergence time of the drift-plus-penalty algorithm for strongly convex programs , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[14]  Michael J. Neely,et al.  Distributed and Secure Computation of Convex Programs over a Network of Connected Processors , 2005 .

[15]  Hao Yu,et al.  A primal-dual type algorithm with the O(1/t) convergence rate for large scale constrained convex programs , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[16]  Tianyi Lin,et al.  On the Convergence Rate of Multi-Block ADMM , 2014, 1408.4265.

[17]  Marimuthu Palaniswami,et al.  Optimal flow control and routing in multi-path networks , 2003, Perform. Evaluation.

[18]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[19]  Leon Hirsch,et al.  Fundamentals Of Convex Analysis , 2016 .

[20]  Angelia Nedic,et al.  Subgradient Methods for Saddle-Point Problems , 2009, J. Optimization Theory and Applications.

[21]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[22]  Ion Necoara,et al.  Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition , 2014, IEEE Transactions on Automatic Control.