Convergence Analysis of Quantized Primal-Dual Algorithms in Network Utility Maximization Problems

This paper investigates the asymptotic and nonasymptotic behavior of the quantized primal-dual (PD) algorithm in network utility maximization (NUM) problems, in which a group of agents maximizes the sum of their individual concave objective functions under linear constraints. In the asymptotic scenario, we use the information-theoretic notion of differential entropy power to establish universal bounds on the maximum exponential convergence rates of joint PD, primal and dual variables under optimum-achieving quantization schemes. These results provide tradeoffs between the speed of exponential convergence, the agents' objective functions, the communication bit rates, and the number of agents and constraints. In the nonasymptotic scenario, we obtain lower bounds on the mean square distance of joint PD, primal and dual variables from the optimal solution at any time instant. These bounds hold regardless of the quantization scheme used.

[1]  Yiguang Hong,et al.  Quantized Subgradient Algorithm and Data-Rate Analysis for Distributed Optimization , 2014, IEEE Transactions on Control of Network Systems.

[2]  Tansu Alpcan,et al.  A utility-based congestion control scheme for Internet-style networks with delay , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  Shengyuan Xu,et al.  Distributed dual averaging method for multi-agent optimization with quantized communication , 2012, Systems & control letters (Print).

[5]  Vincent K. N. Lau,et al.  Convergence-Optimal Quantizer Design of Distributed Contraction-Based Iterative Algorithms With Quantized Message Passing , 2010, IEEE Transactions on Signal Processing.

[6]  John N. Tsitsiklis,et al.  Distributed subgradient methods and quantization effects , 2008, 2008 47th IEEE Conference on Decision and Control.

[7]  Ruggero Carli,et al.  Communication constraints in the average consensus problem , 2008, Autom..

[8]  R. Srikant,et al.  Network Optimization and Control , 2008, Found. Trends Netw..

[9]  Robin J. Evans,et al.  Stabilizability of Stochastic Linear Systems with Finite Feedback Data Rates , 2004, SIAM J. Control. Optim..

[10]  John N. Tsitsiklis,et al.  On Distributed Averaging Algorithms and Quantization Effects , 2008, IEEE Trans. Autom. Control..

[11]  Robert D. Nowak,et al.  Quantized incremental algorithms for distributed optimization , 2005, IEEE Journal on Selected Areas in Communications.

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

[13]  Tansu Alpcan,et al.  Performance Analysis of Gradient-Based Nash Seeking Algorithms Under Quantization , 2016, IEEE Transactions on Automatic Control.

[14]  Tansu Alpcan,et al.  Convergence analysis of quantized primal-dual algorithm in quadratic network utility maximization problems , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[16]  Victor Solo,et al.  Stabilization and Disturbance Attenuation Over a Gaussian Communication Channel , 2010, IEEE Transactions on Automatic Control.