Accelerated dual descent for constrained convex network flow optimization

We present a fast distributed solution to the capacity constrained convex network flow optimization problem. Our solution is based on a distributed approximation of Newtons method called Accelerated Dual Descent (ADD). Our algorithm uses a parameterized approximate inverse Hessian, which is computed using matrix splitting techniques and a Neumann series truncated after N terms. The algorithm is called ADD-N because each update requires information from N-hop neighbors in the network. The parameter N characterizes an explicit trade off between information dependence and convergence rate. Numerical experiments show that even for N=1 and N=2, ADD-N converges orders of magnitude faster than subgradient descent.

[1]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[2]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[3]  Robert E. Tarjan,et al.  Network Flow Algorithms , 1989 .

[4]  Alejandro Ribeiro,et al.  Accelerated backpressure algorithm , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[5]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Convex Optimization Over Random Networks , 2011, IEEE Transactions on Automatic Control.

[6]  Reza Zanjirani Farahani,et al.  Graph Theory for Operations Research and Management: Applications in Industrial Engineering , 2012 .

[7]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

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

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

[10]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[11]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  Alejandro Ribeiro,et al.  Network optimization under uncertainty , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[13]  J. Sun,et al.  Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs , 1998, SIAM J. Optim..

[14]  James B. Orlin,et al.  Minimum Convex Cost Dynamic Network Flows , 1984, Math. Oper. Res..

[15]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[16]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[17]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

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

[19]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.