Primal-dual algorithm for monotropic programming and its application to network optimization

Computational Optimization and Applications

Volumn 15, Issue 2, 2000, Pages 125-143

  Ouorou, A ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUNCTIONS; GAME THEORY; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; VECTORS;

AUGMENTED LAGRANGIAN FUNCTIONS; CONVEX PROGRAMMING; MONOTROPIC PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0033872312     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008782926733     Document Type: Article

References (31)

1. D.P. Bertsekas, Constrained Optimization and Lagrangian Multipliers, Academic Press: NY, 1982.
2. D.P. Bertsekas and R.G. Gallager, Data Networks, Prentice-Hall, 1987.
3. D.P. Bertsekas, PA. Hosein, and P. Tseng, "Relaxation methods for network flow problems with convex arc costs," SIAM J. on Control and Optimization, vol. 25, no. 5, pp. 1219-1243, 1987.
4. D.G. Cantor and M. Gerla, "Optimal routing in a packet-switched computer network," IEEE Transactions on Computers, vol. C-23, no. 10, pp. 1062-1069, 1974.
5. Y. Censor and S.A. Zenios, "The proximal minimization algorithm with D-functions," Journal of Optimization Theory and Applications, vol. 73, pp. 451-464, 1992.
6. G. Chen and M. Teboulle, "A proximal-based decomposition method for convex minimization problems," Mathematical Programming, vol. 64, pp. 81-101, 1994.
7. R.S. Dembo and J.G. Klincewicz, "A scaled reduced gradient algorithm for network flow problems with convex separable costs," Mathematical Programming Study, vol. 15, pp. 125-147, 1981.
8. R.S. Dembo, "A primal truncated Newton method algorithm with application to large-scale nonlinear network optimization," Mathematical Programming Study, vol. 31, pp. 43-71, 1987.
9. J.E. Eckstein and D.P. Bertsekas, "On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators," Mathematical Programming, vol. 55, pp. 293-318, 1992.
10. J.E. Eckstein, "Parallel alternating directiong multiplier decomposition of convex programs," Journal of Optimization Theory and Applications, vol. 80, no. 1, pp. 39-62, 1994.
11. J.E. Eckstein, "Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming," Mathematics of Operations Research, vol. 18, pp. 202-226, 1993.
12. J.E. Eckstein and M. Fukushima, "Some reformulations and applications of the alternating direction method of multipliers," Large Scale Optimization: State of the Art, Kluwer Academic Publishers B.V., 1993, pp. 119-138.
13. A. Hamdi, P. Mahey, and J.R Dussault, "A new decomposition method in nonconvex programs via separable Augmented Lagrangians," in Recent Advances in Optimization, R Gritzman, R. Horst, E. Sachs and R. Tichatschke (Eds.), 1997. Lecture Notes in Economics and Mathematical Systems, Springer, vol. 452, pp. 90-104.
14. A.N. Iusem, B .F. Svaiter, and M. Teboulle, "Entropy-like proximal methods in convex programming," Mathematics of Operations Research, vol. 19, no. 4, pp. 790-814, 1994.
15. M. Kallio and A. Ruszczyński, "Parallel solution of linear programs via Nash equilibria," WP-94-15, IIASA, 1994.
16. J.L. Kennington and R.V. Helgason, "Algorithms for network programming," Wiley: New York, 1980.
17. L. Kleinrock, Communications, Nets, Stochastic Message Flow and Delay, Dover, 1972.
18. K. Kiwiel, "Proximal minimization methods with generalized Bregman functions," WP-95-024, IIASA, 1995.
19. Z.Q. Luo and P. Tseng, "On the convergence of the coordinate descent method for convex differentiable minimization," Journal of Optimization Theory and Applications, vol. 72, no. 1, pp. 7-35, 1992.
20. Z.Q. Luo and P. Tseng, "On the convergence rate of dual ascent methods for linearly constrained convex minimization," Mathematics of Operations Research, vol. 18, no. 4, pp. 846-867, 1993.
21. P. Mahey, A. Ouorou, L.J. LeBlanc, and J. Chifflet, "A New Proximal Decomposition Algorithm for Routing in Telecommunication Networks," Networks, vol. 31, pp. 227-238, 1998.
22. M. Minoux, "A polynomial algorithm for minimum quadratic cost flow problems," European Journal of Operational Research, vol. 18, pp. 377-387, 1984.
23. A. Ouorou, P. Mahey, and J.-Ph. Vial, "A survey of algorithms for convex multicommodity flow problems," Technical Report, Laboratoire Inter-universitaire d'Informatique, de Modélisation et d'Optimisation des Systèmes, Université Blaise Pascal, France, 1997, Management Science, to appear.
24. R.T. Rockafellar, Convex Analysis, Princeton University Press, 1970.
25. R.T. Rockafellar, Network Flows and Monotropic Optimization, John Wiley: New York, NY, 1984.
26. R.T. Rockafellar, "Lagrange multipliers and optimality," SIAM Review, vol. 35, no. 2, pp. 183-238, 1993.
27. A. Ruszczyński, "Augmented Lagrangian decomposition for sparse convex optimization," WP-92-75, IIASA, 1992.
28. G. Stephanopoulos and A.W. Westerberg, "The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization," Journal of Optimization Theory and Applications, vol. 15, no. 3, pp. 285-309, 1975.
29. T.E. Stern, "A class of decentralized routing algorithms using relaxation," IEEE Trans. Communications COM-25, pp. 1092-1102, 1977.
30. M. Teboulle, "Entropic proximal mappings with applications to nonlinear programming," Mathematics of Operations Research, vol. 17, no. 3, pp. 670-690, 1992.
31. N. Watanabe, Y Nishimura, and M. Matsubara, "Decomposition in large system optimization using the method of multiliers," Journal of Optimization Theory and Applications, vol. 25, no. 2, pp. 181-193, 1978.