Relaxation techniques for strictly convex network problems

Gauss—Seidel type relaxation techniques are applied in the context of strictly convex pure networks with separable cost functions. The algorithm is an extension of the Bertsekas—Tseng approach for solving the linear network problem and its dual as a pair of monotropic programming problems. The method is extended to cover the class of generalized network problems. Alternative internal tactics for the dual problem are examined. Computational experiments —aimed at the improved efficiency of the algorithm — are presented.

[1]  Garrett Birkhoff,et al.  Non-linear network problems , 1956 .

[2]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[3]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[4]  Richard P. Brent,et al.  An Algorithm with Guaranteed Convergence for Finding a Zero of a Function , 1971, Comput. J..

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

[6]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[7]  T. Stern,et al.  A Class of Decentralized Routing Algorithms Using Relaxation , 1977, IEEE Trans. Commun..

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

[9]  Fred Glover,et al.  Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .

[10]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[11]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[12]  J. G. Klincewicz,et al.  A scaled reduced gradient algorithm for network flow problems with convex separable costs , 1981 .

[13]  R. Rockafellar.  MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY , 1981 .

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

[15]  D. Bertsekas,et al.  Relaxation methods for minimum cost network flow problems , 1983 .

[16]  Azuma Ohuchi,et al.  Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs , 1984, Networks.

[17]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[18]  Gerald G. Brown,et al.  Solving Generalized Networks , 1984 .

[19]  John M. Mulvey,et al.  Solving Large Scale Generalized Networks , 1985 .

[20]  John M. Mulvey,et al.  Nonlinear programming on generalized networks , 1987, TOMS.

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

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