Ergodic, primal convergence in dual subgradient schemes for convex programming

Mathematical Programming, Series B

Volumn 86, Issue 2, 1999, Pages 283-312

  Larsson, Torbjörn ^a   Patriksson, Michael ^b   Strömberg, Ann Brith ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Convex programming; Ergodic convergence; Lagrangean duality; Lagrangean relaxation; Primal convergence; Road pricing; Subgradient optimization; Traffic equilibrium assignment

Indexed keywords

EID: 0037876458     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050090     Document Type: Article

References (64)

1. Asmuth, R.L. (1978): Traffic Network Equilibria. PhD dissertation, Stanford University, Stanford, CA
2. Balakrishnan, A., Magnanti, T.L., Wong, R.T. (1989): A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37, 716-740
3. Bazaraa, M.S., Sherali, H.D., Shetty, C.M. (1993): Nonlinear Programming. Theory and Algorithms, 2nd edition. Wiley, New York, NY
4. Beasley, J.E. (1993): Lagrangean relaxation. In: Reeves, C.R., ed., Modern Heuristic Techniques for Combinatorial Problems, pp. 243-303. Blackwell Scientific Publications, Oxford
5. Ben-Tal, A., Bendsøe, M.P. (1993): A new method for optimal truss topology design. SIAM J. Optim. 3, 322-358
6. Bernstein, D., Smith, T.E. (1994): Equilibria for networks with lower semicontinuous costs: With an application to congestion pricing. Transp. Sci. 28, 221-235
7. Bertsekas, D.P. (1982): Constrained Optimization and Lagrange Multiplier Methods. Academic Press, San Diego, CA
8. Bertsekas, D.P., Tsitsiklis, J.N. (1989): Parallel and Distributed Computation. Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ
9. Bregman, L.M. (1967): The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comp. Math. Math. Phys. 7, 200-217
10. Burke, J.V., Ferris, M.C. (1991): Characterization of solution sets of convex programs. Oper. Res. Lett. 10, 57-60
11. Cottle, R.W., Duvall, S.G., Zikan, K. (1986): A Lagrangean relaxation algorithm for the constrained matrix problem. Nav. Res. Logist. Quarterly 33, 55-76
12. Dafermos, S., Sparrow, F.T. (1971): Optimal resource allocation and toll patterns in user-optimised transport networks. J. Transp. Econ. Policy 5, 187-200
13. Dantzig, G.B., Wolfe, P. (1960): Decomposition principle for linear programs. Oper. Res. 8, 101-111
14. Dem'yanov, V.F., Malozemov, V.N. (1974): Introduction to Minimax. Wiley, New York, NY
15. Dem'yanov, V.F., Vasil'ev, L.V. (1985): Nondifferentiable Optimization. Optimization Software, New York, NY
16. Dirickx, Y.M.I., Jennergren, L.P. (1979): Systems Analysis by Multilevel Methods. Wiley, Chichester
17. Drissi-Kaïtouni, O. (1990): An algorithm for the decomposition of arc flows into path flows for the general spatial price equilibrium problem. INFOR 28, 403-411
18. Economist, The (1997): Jam today, road pricing tomorrow. December 6-12, pp. 21-24
19. Ermolev, Yu.M. (1966): Methods for solving nonlinear extremal problems. Cybernetics 2(4), 1-14
20. Everett, H. (1963): Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper. Res. 11, 399-417
21. Falk, J.E. (1967): Lagrange multipliers and nonlinear programming. J. Math. Anal. Appl. 19, 141-159
22. Feinberg, B. (1989): Coercion functions and decentralized linear programming. Math. Oper. Res. 14, 177-187
23. Fisher, M.L. (1981): The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27, 1-18
24. Fisher, M.L. (1994): Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42, 626-642
25. Geoffrion, A.M. (1971): Duality in nonlinear programming: A simplified applications-oriented development. SIAM Rev. 13, 1-37
26. Geoffrion, A.M. (1974): Lagrangian relaxation for integer programming. Math. Program. Study 2, 82-114
27. Goffin, J.L., Haurie, A., Vial, J.P. (1992): Decomposition and nondifferentiable optimization with the projective algorithm. Manage. Sci. 38, 284-302
28. Goffin, J.-L., Haurie, A., Vial, J.-Ph., Zhu, D.L. (1993): Using central prices in the decomposition of linear programs. Eur. J. Oper. Res. 64, 393-409
29. Hauer, G.K., Hoganson, H.M. (1996): Tailoring a decomposition method to a large forest management scheduling problem in northern Ontario. INFOR 34, 209-231
30. Higle, J.L., Sen, S. (1991): Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16, 650-669
31. Holmberg, K. (1992): Linear mean value cross decomposition: A generalization of the Kornai-Lipták method. Eur. J. Oper. Res. 62, 55-73
32. Jennergren, P. (1973): A price schedules decomposition algorithm for linear programming problems. Econometrica 41, 965-979
33. Johnson, L.A., Montgomery, D.S. (1974): Operations Research in Production Planning, Scheduling and Inventory Control. Wiley, New York, NY
34. Jones, K.L., Lustig, I.J., Farvolden, J.M., Powell, W.B. (1993): Multicommodity network flows: The impact of formulation on decomposition. Math. Program. 62, 95-117
35. Kiwiel, K.C. (1995): Approximations in bundle methods and decomposition of convex programs. J. Optim. Theory Appl. 84, 529-548
36. Knopp, K. (1956): Infinite Sequences and Series. Dover Publications, New York, NY
37. Kuhn, H.W., Tucker, A.W. (1951): Nonlinear programming. In: Neyman, J., ed., Proceedings of the second Berkeley symposium on mathematical statistics and probability, Department of Mathematics, University of California, July 31-August 12, 1950, pp. 481-492. University of California Press, Berkeley, CA
38. Lamond, B., Stewart, N.F. (1981): Bregman's balancing method. Transp. Res. 15B, 239-248
39. Larsson, T., Liu, Z. (1997): A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows. Optimization 40, 247-284
40. Larsson, T., Liu, Z., Patriksson, M. (1997): A dual scheme for traffic assignment problems. Optimization 42, 323-358
41. Larsson, T., Patriksson, M. (1992): Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transp. Sci. 26, 4-17
42. Larsson, T., Patriksson, M., Strömberg, A.-B. (1996a): Conditional subgradient optimization - Theory and applications. Eur. J. Oper. Res. 88, 382-403
43. Larsson, T., Patriksson, M., Strömberg, A.-B. (1996b): Ergodic results and bounds on the optimal value in subgradient optimization. In: Kleinschmtdt, P. et al., eds., Operations Research Proceedings 1995, Selected papers of the Symposium on Operations Research, Passau, Germany, September, 1995, pp. 30-35. Springer, Berlin
44. Larsson, T., Patriksson, M., Strömberg, A.-B. (1998): Ergodic convergence in subgradient optimization. Optim. Methods Software 9, 93-120
45. Lasdon, L.S. (1968): Duality and decomposition in mathematical programming. IEEE Trans. Systems Sci. Cybernet. SSC4, 86-100
46. Lasdon, L.S. (1970): Optimization Theory for Large Systems. Macmillan, London
47. LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P. (1975): An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9, 309-318
48. Mangasarian, O.L. (1981): Iterative solution of linear programs. SIAM J. Numer. Anal. 18, 606-614
49. Patriksson, M. (1994): The Traffic Assignment Problem: Models and Methods, Topics in Transportation series. VSP, Utrecht, The Netherlands
50. Petersson, J., Patriksson, M. (1997): Topology optimization of sheets in contact by a subgradient method. Int. J. Numer. Methods Eng. 40, 1295-1321
51. Polyak, B.T. (1967): A general method of solving extremum problems. Sov. Math. Dokl. 8(3), 593-597
52. Polyak, B.T. (1969): Minimization of unsmooth functionals. USSR Comp. Math. Math. Phys. 9, 14-29
53. Powell, W.B., Sheffi, Y. (1982): The convergence of equilibrium algorithms with predetermined step sizes. Transp. Sci. 16, 45-55
54. Robinson, S.M. (1984): Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy. Math. Program. Study 22, 217-230
55. Rockafellar, R.T. (1970): Convex Analysis. Princeton University Press, Princeton, NJ
56. Rockafellar, R.T. (1976): Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97-116
57. Rudin, W. (1976): Principles of Mathematical Analysis, third edition. McGraw-Hill, Singapore
58. Ruszczynski, A. (1989): An augmented Lagrangean decomposition method for block diagonal linear programming problems. Oper. Res. Lett. 8, 287-294
59. Sherali, H.D., Choi, G. (1996): Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper. Res. Lett. 19, 105-113
60. Shor, N.Z. (1985): Minimization Methods for Non-Differentiable Functions. Springer, Berlin
61. Small, K.A. (1992): Using the revenues from congestion pricing. Transportation 19, 359-381
62. Svanberg, K. (1982): An algorithm for optimum structural design using duality. Math. Program. Study 20, 161-177
63. Uzawa, H. (1958): Iterative methods for concave programming. In: Arrow, K.J., Hurwicz, L., Uzawa, H., eds., Studies in Linear and Nonlinear Programming, pp. 154-165. Stanford University Press, Stanford, CA
64. Wardrop, J.G. (1952): Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, pp. 325-378