Lagrangian relaxation via ballstep subgradient methods

Mathematics of Operations Research

Volumn 32, Issue 3, 2007, Pages 669-686

  Kiwiel, Krzysztof C ^a   Larsson, Torbjörn ^b   Lindberg, P O ^b  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

^b LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Convex programming; Lagrangian relaxation; Level projection methods; Nondifferentiable optimization; Subgradient optimization

Indexed keywords

LAGRANGE MULTIPLIERS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES;

CONVEX PROGRAMMING; LAGRANGIAN RELAXATION; LEVEL PROJECTION METHODS; NONDIFFERENTIABLE OPTIMIZATION; SUBGRADIENT OPTIMIZATION;

NUMERICAL METHODS;

EID: 38549126759     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0261     Document Type: Article

References (45)

1. Anstreicher, K. M., L. Wolsey. 1993. On dual solutions in subgradient optimization. Technical report, Department of Management Sciences, University of Iowa, Iowa City, IA.
2. Bahiense, L., N. Maculan, C. A. Sagastizábal. 2002. The volume algorithm revisited: Relation with bundle methods. Math. Programming 94 41-69.
3. Balas, E., M. C. Carrera. 1996. A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6) 875-890.
4. Barahona, F., R. Anbil. 2000. The volume algorithm: Producing primal solutions with a subgradient method. Math. Programming 87(3) 385-399.
5. Barahona, F., R. Anbil. 2002. On some difficult linear programs coming from set partitioning. Discrete Appl. Math. 118(1-2) 3-11.
6. Barahona, F., D. Chudák. 2000. Solving large scale uncapacitated facility location problems. P. M. Pardalos, ed. Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer, Dordrecht, The Netherlands, 48-62.
7. Ben-Tal, A., T. Margalit, A. Nemirovski. 2001. The ordered subsets mirror descent optimization method with applications to tomography. SIAM J. Optim. 12(1) 79-108.
8. Bertsekas, D. P. 1998. Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont, MA.
9. Bertsekas, D. P. 1999. Nonlinear Programming, 2nd ed. Athena Scientific, Belmont, MA.
10. Burke, J. V., M. C. Ferris. 1991. Characterization of solutions sets of convex programs. Oper. Res. Lett. 10 57-60.
11. Ceria, S., P. Nobili, A. Sassano. 1998. A Lagrangian-based heuristic for large-scale set covering problems. Math. Programming 81(2) 215-228.
12. Feltenmark, S., K. C Kiwiel. 2000. Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. SIAM J. Optim. 10(3) 697-721.
13. Fukushima, M. 1984. A nonsmooth optimization approach to nonlinear multicommodity network flow problems. J. Oper. Res. Soc. Japan 27(2) 151-176.
14. Fukushima, M. 1984. On a dual approach to the traffic assignment problem. Transportation Res. 18 235-245.
15. Gallo, G., S. Pallotino. 1988. Shortest path algorithms. Ann. Oper. Res. 13 3-79.
16. Goffin, J.-L. 1987. The ellipsoid method and its predecessors. L. Contesse, R. Correa, A. Weintraub, eds. Recent Advances in System Modelling and Optimization. Lecture Notes in Control and Information Sciences, Vol. 87. Springer-Verlag, Berlin, Germany, 127-141.
17. Goffin, J.-L., J. Gondzio, R. Sarkissian, J.-Ph. Vial. 1996. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Programming 76(1) 131-154.
18. Gondzio, J., R. Sarkissian, J.-Ph. Vial. 1997. Using an interior point method for the master problem in a decomposition approach. Eur. J. Oper. Res. 101 577-587.
19. Hiriart-Urruty, J.-B., C. Lemaréchal. 1993. Convex Analysis and Minimization Algorithms. Springer, Berlin, Germany.
20. Kiwiel, K. C. 1990. Proximity control in bundle methods for convex nondifferentiable minimization. Math. Programming 46 105-122.
21. Kiwiel, K. C. 1995. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Programming 69 89-109.
22. Kiwiel, K. C. 1996. The efficiency of subgradient projection methods for convex optimization. Part II: Implementations and extensions. SIAM J. Control Optim. 34(2) 677-697.
23. Kiwiel, K. C. 2000. Efficiency of proximal bundle methods. J. Optim. Theory Appl. 104(3) 589-603.
24. Kiwiel, K. C. 2004. Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14(3) 807-840.
25. Kiwiel, K. C., P. O. Lindberg. 2001. Parallel subgradient methods for convex optimization. D. Butnariu, Y. Censor, S. Reich, eds. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Studies in Computational Mathematics, Vol. 8. Elsevier, Amsterdam, The Netherlands, 335-344.
26. Kiwiel, K. C., T. Larsson, P. O. Lindberg. 1999. Dual properties of ballstep subgradient methods, with applications to Lagrangian relaxation. Technical Report LiTH-MAT-R-1999-24, Department of Mathematics, Linköping University, Linköping, Sweden. Revised October 2002, and December 2005.
27. Kiwiel, K. C., T. Larsson, P. O. Lindberg. 1999. The efficiency of ballstep subgradient level methods for convex optimization. Math. Oper. Res. 24(1) 237-254.
28. Larsson, T., Z. Liu. 1997. A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows. Optimization 40 247-284.
29. Larsson, T., Z. Liu, M. Patriksson. 1997. A dual scheme for traffic assignment problems. Optimization 42 323-358.
30. Larsson, T., M. Patriksson, C. Rydergren. 1997. Applications of simplicial decomposition with nonlinear column generation to nonlinear network flows. P. M. Pardalos, D. W. Hearn, W. W. Hager, eds. Network Optimization. Lecture Notes in Economics and Mathematical Systems, Vol. 450. Springer-Verlag, Berlin, Germany, 346-373.
31. Larsson, T., M. Patriksson, A.-B. Strömberg. 1998. Ergodic convergence in subgradient optimization. Optim. Methods Software 9(1-3) 93-120.
32. Larsson, T., M. Patriksson, A.-B. Strömberg. 1999. Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Programming 86(2) 283-312.
33. Lemaréchal, C., A. S. Nemirovskii, Yu. E. Nesterov. 1995. New variants of bundle methods. Math. Programming 69(1) 111-147.
34. Nedić, A., D. P. Bertsekas. 2001. Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1) 109-138.
35. Nedić, A., D. P. Bertsekas, V. S. Borkar. 2001. Distributed asynchronous incremental subgradient methods. D. Butnariu, Y. Censor, S. Reich, eds. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Studies in Computational Mathematics, Vol. 8. Elsevier, Amsterdam, The Netherlands, 381-407.
36. Ouorou, A., P. Mahey, J.-Ph. Vial. 2000. A survey of algorithms for convex multicommodity flow problems. Management Sci. 46(1) 126-147.
37. Polyak, B. T. 1969. Minimization of unsmooth functionals. Zh. Vychisl. Mat. i Mat. Fiz. 9 509-521 (Russian).
38. English transl. (1969) in U.S.S.R. Comput. Math. Math. Phys. 9(3) 14-29.
39. Polyak, B. T. 1983. Introduction to Optimization. Nauka, Moscow USSR. English transl. 1987. Optimization Software Inc., New York.
40. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
41. Sen, S., H. D. Sherali. 1986. A class of convergent primal-dual subgradient algorithms for decomposable convex programs. Math. Programming 35(3) 279-297.
42. Sherali, H. D., G. Choi. 1996. Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper. Res. Lett. 19 105-113.
43. Shor, N. Z. 1979. Minimization Methods for Non-Differentiable Functions. Nauková Dumka, Kiev (Russian), English transl., Springer-Verlag, Berlin, Germany (1985).
44. Tatineni, M., H. Edwards, D. Boyce. 1998. Comparison of disaggregate simplicial decomposition and Frank-Wolfe algorithms for user-optimal route choice. Transportation Res. Record 1617 157-162.
45. Zhurbenko, N. G. 1977. Investigation of a class of algorithms for minimizing nonsmooth functions and their application to the solution of large-scale problems. Dissertation, Cybernetics Institute, Academy of Sciences of the Ukrainian SSR, Kiev, USSR.