Centralized and Distributed Newton Methods for Network Optimization and Extensions

We consider Newton methods for common types of single commodity and multi-commodity network ow problems. Despite the potentially very large dimension of the problem, they can be implemented using the conjugate gradient method and low-dimensional network operations, as shown nearly thirty years ago. We revisit these methods, compare them to more recent proposals, and describe how they can be implemented in a distributed computing system. We also discuss generalizations, including the treatment of arc gains, linear side constraints, and related special structures.

[1]  M. Projected Newton Methods and Optimization of Multicommodity Flows , 2022 .

[2]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[3]  E. Polak Introduction to linear and nonlinear programming , 1973 .

[4]  Charles A. Holloway An extension of the frank and Wolfe method of feasible directions , 1974, Math. Program..

[5]  D. Bertsekas Partial conjugate gradient methods for a class of optimal control problems , 1974 .

[6]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[7]  Balder Von Hohenbalken,et al.  Simplicial decomposition in nonlinear programming algorithms , 1977, Math. Program..

[8]  D. Bertsekas A class of optimal routing algorithms for communication networks , 1980 .

[9]  Robert G. Gallager,et al.  Flow Control and Routing Algorithms for Data Networks , 1980 .

[10]  D. Bertsekas Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[11]  D. Bertsekas Projected Newton methods for optimization problems with simple constraints , 1981, CDC 1981.

[12]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[13]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[14]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

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

[16]  Dimitri P. Bertsekas,et al.  Distributed asynchronous computation of fixed points , 1983, Math. Program..

[17]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[18]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[19]  D. Bertsekas,et al.  TWO-METRIC PROJECTION METHODS FOR CONSTRAINED OPTIMIZATION* , 1984 .

[20]  J. A. Ventura,et al.  Finiteness in restricted simplicial decomposition , 1985 .

[21]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[22]  J. A. Ventura,et al.  Restricted simplicial decomposition: computation and extensions , 1987 .

[23]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[24]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[25]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1995 .

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

[27]  S. Low,et al.  Optimization flow control with Newton-like algorithm , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[28]  I. Jktroduction Distributed Asynchronous Optimal Routing in Data Networks , 2001 .

[29]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[30]  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.

[31]  Asuman E. Ozdaglar,et al.  A distributed Newton method for Network Utility Maximization , 2010, 49th IEEE Conference on Decision and Control (CDC).

[32]  Dimitri P. Bertsekas,et al.  A Unifying Polyhedral Approximation Framework for Convex Optimization , 2011, SIAM J. Optim..

[33]  A. Jadbabaie,et al.  A Distributed Newton Method for Network Utility Maximization–I: Algorithm , 2013, IEEE Transactions on Automatic Control.