论文信息 - Algorithms for Nonlinear Multicommodity Network Flow Problems

Algorithms for Nonlinear Multicommodity Network Flow Problems

This paper presents a class of algorithms for optimization of convex multi-commodity flow problems. The algorithms are based on the ideas of Gallager’s methods for distributed optimization of delay in data communication networks [1], [2], and gradient projection ideas from nonlinear programming [3],[4].

Dimitri P. Bertsekas | D. Bertsekas

[1] R. Brent. Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973) , 1975 .

[2] Eli Gafni,et al. Validation of algorithms for optimal routing of flow in networks , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[3] D. Bertsekas. On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[4] Boris Polyak,et al. Constrained minimization methods , 1966 .

[5] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .

[6] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[7] J. Daniel. On the approximate minimization of functionals , 1969 .

[8] A. Goldstein. Convex programming in Hilbert space , 1964 .