Claude Lemaréchal

[Bonnans et al., 2003]
 
Show BibTeX entry
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]
 
Show BibTeX entry
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]
 
Show BibTeX entry
J.-B. Hiriart-Urruty and C. Lemaréchal (2001).
Fundamentals of Convex Analysis.
Springer Verlag, Heidelberg.
[Lemaréchal, 2001]
 
Show BibTeX entry
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]
 
Show BibTeX entry
C. Lemaréchal (2002).
Borner, convexifier, relaxer_ l'omniprésence de Lagrange.
In: Bulletin de la Roadef, 8:6--9.
[Lemaréchal, 2003]
 
Show BibTeX entry
C. Lemaréchal (2003).
The omnipresence of Lagrange.
In: 4OR, 1(1):7,25.
[Lemaréchal and Mifflin, 1982]
 
Show BibTeX entry
C. Lemaréchal and R. Mifflin (1982).
Global and Superlinear Convergence of an Algorithm for one-dimensional minimzation of convex functions.
In: Mathematical Programming, 24:241--256.
[Lemaréchal et al., 1995]
 
Show BibTeX entry
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, 1999]
 
Show BibTeX entryVisit the webpage of the paper
C. Lemaréchal and F. Oustry (1999).
Semi-definite relaxations and Lagrangian duality with application to combinatorial optimization.
Rapport de Recherche Nr. 3710. Inria. \tt http_//www.inria.fr/rrrt/rr-3710.html.
[Lemaréchal and Oustry, 2000]
 
Show BibTeX entry
C. Lemaréchal and F. Oustry (2000).
Nonsmooth algorithms to solve semidefinite programs.
In: L. El Ghaoui and S-I. Niculescu (eds.), Advances in Linear Matrix Inequality Methods in Control. Advances in Design and Control, 2. pp. 57--77. SIAM.
[Lemaréchal and Oustry, 2001]
 
Show BibTeX entry
C. Lemaréchal and F. Oustry (2001).
SDP relaxations in combinatorial optimization from a Lagrangian point of view.
In: N. Hadjisavvas and P. M. Pardalos (eds.), Advances in Convex Analysis and Global Optimization. pp. 119--134. Kluwer.
[Lemaréchal and Oustry, 2001]
 
Show BibTeX entry
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]
 
Show BibTeX entry
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]
 
Show BibTeX entry
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]
 
Show BibTeX entry
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]
 
Show BibTeX entry
C. Lemaréchal and C. Sagastizábal (1997).
Practical aspects of the Moreau-Yosida regularization_ theoretical preliminaries.
In: Siam Journal on Optimization, 7(2):367--385.
[Lemaréchal and Sagastizábal, 1997]
 
Show BibTeX entry
C. Lemaréchal and C. Sagastizábal (1997).
Variable metric bundle methods_ from conceptual to implementable forms.
In: Mathematical Programming, 76(3):393--410.