The omnipresence of Lagrange

4OR

Volumn 1, Issue 1, 2003, Pages 7-25

  Lemaréchal, Claude ^a  

^a INRIA   (France)

Author keywords

column generation; combinatorial optimization; duality; Lagrange relaxation

Indexed keywords

EID: 84891645442     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-002-0003-1     Document Type: Article

References (33)

1. Alizadeh F (1995) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization 5(1): 13-51.
2. Bertsekas DP (1995) Nonlinear Programming. Athena Scientific.
3. Bertsekas DP, Lauer GS, Sandell NR, Posberg TA (1983) Optimal short-term scheduling of large-scale power systems. IEEE Transactions on Automatic Control AC-28: 1-11.
4. Feltenmark S, Kiwiel KC (2000) Dual applications of proximal bundle methods, including lagrangian relaxation of nonconvex problems. SIAM Journal on Optimization 10(3): 697-721.
5. FisherML (1973) Optimal solution of scheduling problems using lagrange multipliers: Part i. Operations Research 21: 1114-1127.
6. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Mathematical Programming Study 2: 82-114.
7. Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 6: 1115-1145.
8. Goemans MX (1997) Semidefinite programming in combinatorial optimization. Mathematical Programming 79: 143-161.
9. Goffin JL, Haurie A, Vial JPh (1992) Decomposition and nondifferentiable optimization with the projective algorithm. Management Science 38(2): 284-302.
10. Grinold RC (1970) Lagrangian subgradients. Management Science 17(3): 185-188.
11. Grötschel M, Lovász L, SchrijverA (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1: 169-197.
12. Held M, Karp R (1971) The travelling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1: 6-25.
13. Hiriart-Urruty J-B, Lemaréchal C (1993) Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg (Two volumes).
14. Hiriart-Urruty J-B, LemaréchalC (2001) Fundamentals of Convex Analysis. SpringerVerlag, Heidelberg.
15. Horn RA, Johnson ChR (1989) Matrix Analysis. Cambridge University Press. (New edition, 1999).
16. Kiwiel KC (1986) A method for solving certain quadratic programming problems arising in nonsmooth optimization. IMA Journal of Numerical Analysis 6: 137-152.
17. Lasdon L (1970) Optimization Theory for Large Systems. Macmillan, Series in Operations Research.
18. Lemaréchal C (1974) An algorithm for minimizing convex functions. In: Rosenfeld JL (ed) Information Processing '74, North Holland, pp 552-556.
19. Lemaréchal C (2001) Lagrangian relaxation. In: Jünger M, Naddef D (eds) Computational Combinatorial Optimization, Springer Verlag, Heidelberg, pp 115-160.
20. Lemaréchal C, Oustry F (1999) Semi-definite relaxations and lagrangian duality with application to combinatorial optimization. Rapport de Recherche 3710, Inria (http://www. inria. fr/rrrt/rr-3710. html).
21. Lemaréchal C, Renaud A (2001) A geometric study of duality gaps, with applications. Mathematical Programming 90(3): 399-427.
22. Lemaréchal C, Sagastizábal C (1997) Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming 76(3): 393-410.
23. Magnanti TL, Shapiro JF, Wagner MH (1976) Generalized linear programming solves the dual. Management Science 22(11): 1195-1203.
24. Muckstadt MA, Koenig SA (1977) An application of lagrangian relaxation to scheduling in powergeneration systems. Operations Research 25: 387-403.
25. Nemirovskii AS, Yudin D (1983) Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience Series in Discrete Mathematics (original Russian: Nauka, 1979).
26. Poljak S, Rendl F, Wolkowicz H (1995) A recipe for semidefinite relaxation for (0, 1)-quadratic programming. Journal of Global Optimization 7: 51-73.
27. Reeves CR (1993) Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, NewYork.
28. Shor NZ (1985) Minimization methods for non-differentiable functions. Springer Verlag, Berlin.
29. Stetsenko SI, ShorNZ (1984) The connection between Lovász'estimates with dual estimates in quadratic Boolean problems. In: Solutions Methods of Nonlinear and Discrete Programming, Proceedings of the seminar "National Council on Cybernetics". Institute of Cybernetics, Kiev.
30. Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Review 38(1): 49-95.
31. Vanderbeck, F (2000) On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 47(1): 111-128.
32. Wolfe, P (1975) A method of conjugate subgradients for minimizing nondifferentiable functions. Mathematical Programming Study 3: 145-173.
33. Wolsey, LA (1998) Integer Programming. Wiley-Interscience.