On a primal-proximal heuristic in discrete optimization

Mathematical Programming

Volumn 104, Issue 1, 2005, Pages 105-128

  Daniilidis, A ^a   Lemarechal C ^a  

^a INRIA   (France)

Author keywords

Lagrangian relaxation; Primal dual heuristics; Proximal algorithm

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; LAGRANGE MULTIPLIERS; OPTIMIZATION; PROBLEM SOLVING;

LAGRANGIAN RELAXATION; PRIMAL-DUAL HEURISTICS; PROXIMAL ALGORITHMS;

HEURISTIC METHODS;

EID: 24044478749     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0571-2     Document Type: Article

References (16)

1. Bertsekas, D.P.: Convexification procedures and decomposition methods for nonconvex optimization problems. J. Optimization Theory Appl. 29, 169-197 (1979)
2. Bertsekas, D.P., Lauer, G.S., Sandell, N.R., Posberg, T.A.: Optimal short-term scheduling of large-scale power systems. IEEE Transactions on Automatic Control AC-28, 1-11 (1983)
3. Daniilidis, A., Lemaréchal, C.: Proximal convexification procedures in combinatorial optimization. RR 4550, Inria, 2002, www.inria.fr/rrrt/rr-4550.html
4. Danskin, J.M.: The theory of max-min with applications. SIAM J. Appl. Math. 14 (4), 641-655 (1966)
5. Dubost, L., Gonzalez, R., Lemaréchal, C.: A primal-proximal heuristic applied to the french unit-commitment problem. Mathematical Programming 104, 129-151 (2005)
6. Falk, J.E.: Lagrange multipliers and nonconvex programs. SIAM J. Cont. 7(4), 534-545 (1969)
7. Feltenmark, S., Kiwiel, K.C.: Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. SIAM J. Optimization 10(3), 697-721 (2000)
8. Geoffrion, A.M.: Lagrangean relaxation for integer programming. Math. Program. Study 2, 82-114 (1974)
9. Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg, 1993, Two volumes
10. Hiriart-Urruty, J.-B., Lemaréchal, C.: Fundamentals of Convex Analysis. Springer Verlag, Heidelberg, 2001
11. Lemaréchal, C. : Lagrangian relaxation. In: M. Jünger, D. Naddef (eds.), Comput. Combinatorial Optimization, Springer Verlag, Heidelberg, 2001, pp. 115-160
12. Lemaréchal, C., Pellegrino, F., Renaud, A., Sagastizábal, C.: Bundle methods applied to the unit-commitment problem. In: J. Doležal, J. Fidler (eds.), System Modelling and Optimization, Chapman and Hall, 1996, pp. 395-402
13. Lemaréchal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90(3), 399-427 (2001)
14. Magnanti, T.L., Shapiro, J.F., Wagner, M.H.: Generalized linear programming solves the dual. Management Science 22(11), 1195-1203 (1976)
15. Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Cont. 12, 268-285 (1974)
16. Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer Verlag, Heidelberg, 1998