A distributed line search for network optimization

Dual descent methods are used to solve network optimization problems because descent directions can be computed in a distributed manner using information available either locally or at neighboring nodes. However, choosing a stepsize in the descent direction remains a challenge because its computation requires global information. This work presents an algorithm based on a local version of the Armijo rule that allows for the computation of a stepsize using only local and neighborhood information. We show that when our distributed line search algorithm is applied with a descent direction computed according to the Accelerated Dual Descent method [18], key properties of standard backtracking line search using the Armijo rule are recovered. We use simulations to demonstrate that our algorithm is a practical substitute for its centralized counterpart.

[1]  William W. Hager,et al.  A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization , 2004, SIAM J. Optim..

[2]  John G. Klincewicz,et al.  A Newton method for convex separable network flow problems , 1983, Networks.

[3]  Asuman E. Ozdaglar,et al.  Subgradient methods in network resource allocation: Rate analysis , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[4]  Alejandro Ribeiro,et al.  Accelerated dual descent for network optimization , 2011, Proceedings of the 2011 American Control Conference.

[5]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

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

[7]  Steven H. Low,et al.  Optimization flow control with Newton‐like algorithm , 2000, Telecommun. Syst..

[8]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

[10]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[11]  Steven H. Low,et al.  Convergence of Asynchronous Optimization Flow Control , 1999, Broadband Communications.

[12]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[13]  Yuhong Dai.  On the Nonmonotone Line Search , 2002 .

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

[15]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[17]  Asuman E. Ozdaglar,et al.  A distributed newton method for network optimization , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[18]  William W. Hager,et al.  A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search , 2005, SIAM J. Optim..

[19]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[20]  F. Fagnani,et al.  Communication constraints in coordinated consensus problems , 2006, 2006 American Control Conference.