Claude Lemaréchal |
[Bonnans et al., 2003] |
J. F. Bonnans and J. Ch. Gilbert and C. Lemaréchal and C. Sagastizábal (2003). Numerical Optimization. Springer Verlag. |
[Hiriart-Urruty and Lemaréchal, 1996] |
J.-B. Hiriart-Urruty and C. Lemaréchal (1996). Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg. Two volumes - 2nd printing. |
[Hiriart-Urruty and Lemaréchal, 2001] |
J.-B. Hiriart-Urruty and C. Lemaréchal (2001). Fundamentals of Convex Analysis. Springer Verlag, Heidelberg. |
[Lemaréchal, 2001] |
C. Lemaréchal (2001). Lagrangian relaxation. In: M. Jünger and D. Naddef (eds.), Computational Combinatorial Optimization. pp. 115--160. Springer Verlag, Heidelberg. |
[Lemaréchal, 2002] |
C. Lemaréchal (2002). Borner, convexifier, relaxer_ l'omniprésence de Lagrange. In: Bulletin de la Roadef, 8:6--9. |
[Lemaréchal, 2003] |
C. Lemaréchal (2003). The omnipresence of Lagrange. In: 4OR, 1(1):7,25. |
[Lemaréchal et al., 1995] |
C. Lemaréchal and A. S. Nemirovskii and Yu.E. Nesterov (1995). New variants of bundle methods. In: Mathematical Programming, 69:111--148. |
[Lemaréchal and Oustry, 2001] |
C. Lemaréchal and F. Oustry (2001). Growth conditions and $\cal U$-Lagrangians. In: Set-Valued Analysis, 9(1/2):123--129. |
[Lemaréchal et al., 2000] |
C. Lemaréchal and F. Oustry and C. Sagastizábal (2000). The $\cal U$-Lagrangian of a convex function. In: Transactions of the AMS, 352(2):711--729. |
[Lemaréchal and Renaud, 2001] |
C. Lemaréchal and A. Renaud (2001). A geometric study of duality gaps, with applications. In: Mathematical Programming, 90(3):399--427. |
[Lemaréchal and Sagastizábal, 1996] |
C. Lemaréchal and C. Sagastizábal (1996). More than first-order developments of convex functions_ primal-dual relations. In: Journal of Convex Analysis, 3(2):1--14. |
[Lemaréchal and Sagastizábal, 1997] |
C. Lemaréchal and C. Sagastizábal (1997). Variable metric bundle methods_ from conceptual to implementable forms. In: Mathematical Programming, 76(3):393--410. |