Abstract
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],
Preview
Unable to display preview. Download preview PDF.
References
Gallager, R., "A Minimum Delay Routing Algorithm Using Distributed Computation," IEEE Trans. on Communication, vol. COM-25, 1974, pp. 73–85.
Gallager, R., "Scale Factors for Distributed Routing Algorithms," Paper ESL-P-770, Electronic Systems Lab., Massachusetts Institute of Technology, Cambridge, Mass., August 1977.
Goldstein, A. A., "Convex Programming in Hilbert Space," Bull. Amer. Math. Soc., Vol. 70, 1964, pp. 709–710.
Levitin, E. S. and B. T. Polyak, "Constrained Minimization Problems," USSR Comput. Math. Math. Phys., Vol. 6, 1966, pp. 1–50.
Bertsekas, D. P., "Algorithms for Optimal Routing of Flow in Networks," Coordinated Science Lab., University of Illinois, Urbana, Ill., June 1978.
Daniel, J. W., The Approximate Minimization of Functionals, Prentice-Hall, Englewood Cliffs, N.J., 1971.
Polak, E., Computational Methods in Optimization: A Unified Approach, Academic Press, N.Y., 1971.
Bertsekas, D. P., "On the Goldstein-Levitin-Polyak Gradient Projection Method," IEEE Transactions on Automatic Control, Vol. AC-21, 1976, pp. 174–184.
Bertsekas, D. P., E. Gafni, and K. Vastola, "Validation of Algorithms for Optimal Routing of Flow in Networks," Proc. of IEEE Conf. on Decision and Control, San Diego, Calif., January 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
Bertsekas, D.P. (1979). Algorithms for nonlinear multicommodity network flow problems. In: Bensoussan, A., Lions, J.L. (eds) International Symposium on Systems Optimization and Analysis. Lecture Notes in Control and Information Sciences, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002656
Download citation
DOI: https://doi.org/10.1007/BFb0002656
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09447-0
Online ISBN: 978-3-540-35232-7
eBook Packages: Springer Book Archive