# Lemaréchal

### From Wikimization

Line 4: | Line 4: | ||

==Abridged curriculum of Claude Lemaréchal== | ==Abridged curriculum of Claude Lemaréchal== | ||

– French; born April 1st 1944 in Paris. | – French; born April 1st 1944 in Paris. | ||

+ | |||

– 1967: “Ingénieur” in Applied Mathematics, Ecole Nationale Supérieure d’Electrotechnique, d’Informatique, d’Hydraulique de Toulouse. | – 1967: “Ingénieur” in Applied Mathematics, Ecole Nationale Supérieure d’Electrotechnique, d’Informatique, d’Hydraulique de Toulouse. | ||

+ | |||

– 1969: “Docteur-lngénieur”, University of Toulouse. | – 1969: “Docteur-lngénieur”, University of Toulouse. | ||

+ | |||

– 1980: “Docteur `es Sciences Mathématiques”, University of Paris IX. | – 1980: “Docteur `es Sciences Mathématiques”, University of Paris IX. | ||

+ | |||

– Present address: Institut National de Recherche en Informatique et Automatique, 655 avenue de l’Europe, 38330 Montbonnot, France. | – Present address: Institut National de Recherche en Informatique et Automatique, 655 avenue de l’Europe, 38330 Montbonnot, France. | ||

+ | |||

– Former head of the Research Project Teamss “Théorie des Systems”, “Programmation Mathématique”, “Optimisation Numérique”. | – Former head of the Research Project Teamss “Théorie des Systems”, “Programmation Mathématique”, “Optimisation Numérique”. | ||

+ | |||

– Professor at the University of Paris 1 from 1994 to 1997. | – Professor at the University of Paris 1 from 1994 to 1997. | ||

+ | |||

– Professor at ´ Ecole Nationale Supérieure d’Ingénieurs en Mathématiques | – Professor at ´ Ecole Nationale Supérieure d’Ingénieurs en Mathématiques | ||

Appliquées de Grenoble from 1999 to 2006. | Appliquées de Grenoble from 1999 to 2006. | ||

+ | |||

– Dantzig Prize 1994. | – Dantzig Prize 1994. | ||

+ | |||

Internationally known for his works in numerical optimization, especially | Internationally known for his works in numerical optimization, especially | ||

nonsmooth optimization, and its applications in different areas such as: fluid | nonsmooth optimization, and its applications in different areas such as: fluid | ||

Line 23: | Line 32: | ||

(production management, networking, finance, geophysics, ''etc.''). | (production management, networking, finance, geophysics, ''etc.''). | ||

Author of over 50 publications in international journals; some of the most significant ones are: | Author of over 50 publications in international journals; some of the most significant ones are: | ||

+ | |||

1. Nonsmooth Optimization. Proceedings, Pergamon Press (1978) (with R. Mifflin). | 1. Nonsmooth Optimization. Proceedings, Pergamon Press (1978) (with R. Mifflin). | ||

+ | |||

2. Convex Analysis and Minimization Algorithms. Springer Verlag, Grundlehren 305, 306 (1993) (with J.B. Hiriart-Urruty). | 2. Convex Analysis and Minimization Algorithms. Springer Verlag, Grundlehren 305, 306 (1993) (with J.B. Hiriart-Urruty). | ||

+ | |||

3. Fundamentals of Convex Analysis. Springer Verlag, Grundlehren Text Editions (2001) (with J.B. Hiriart-Urruty). | 3. Fundamentals of Convex Analysis. Springer Verlag, Grundlehren Text Editions (2001) (with J.B. Hiriart-Urruty). | ||

- | 4. Numerical Optimisation: Theoretical and Practical Aspects. Springer Verlag, Universitext (2003) (with J.F. Bonnans, J.Ch. Gilbert, C. Sagastiz´abal). | + | |

+ | 4. Numerical Optimisation: Theoretical and Practical Aspects. Springer Verlag, Universitext (2003) (with J.F. Bonnans, J. Ch. Gilbert, C. Sagastiz´abal). | ||

5. An algorithm for minimizing convex functions. Proceedings, Information | 5. An algorithm for minimizing convex functions. Proceedings, Information | ||

Processing ’74, Stockholm (1974). | Processing ’74, Stockholm (1974). | ||

+ | |||

6. Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization 7,2 (1997) 367-385 (with C. Sagastiz´abal). | 6. Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization 7,2 (1997) 367-385 (with C. Sagastiz´abal). | ||

+ | |||

7. Variable metric bundle methods: from conceptual to implementable forms. | 7. Variable metric bundle methods: from conceptual to implementable forms. | ||

Mathematical Programming 76,3 (1997), pp. 393-410 (with C. Sagastiz´abal). | Mathematical Programming 76,3 (1997), pp. 393-410 (with C. Sagastiz´abal). | ||

+ | |||

8. The U-Lagrangian af a convex function. Transactions of the AMS 352,2 | 8. The U-Lagrangian af a convex function. Transactions of the AMS 352,2 | ||

(2000), pp. 711-729 (with F. Oustry and C. Sagastiz´abal). | (2000), pp. 711-729 (with F. Oustry and C. Sagastiz´abal). | ||

- | 9. Lagrangian relaxation. in: Computational Combinatorial Optimization, | + | |

- | M. J¨unger, D. Naddef (eds.) Springer Verlag (2001), pp. 112-156. | + | 9. Lagrangian relaxation. in: Computational Combinatorial Optimization, M. J¨unger, D. Naddef (eds.) Springer Verlag (2001), pp. 112-156. |

+ | |||

10. A primal-proximal heuristic applied to the French unit-commitment problem. Mathematical Programming 104,1 (2005) pp. 129-152 (with L. Dubost, R. Gonzalez). | 10. A primal-proximal heuristic applied to the French unit-commitment problem. Mathematical Programming 104,1 (2005) pp. 129-152 (with L. Dubost, R. Gonzalez). | ||

- | 11. On the equivalence between complementarity systems, projected systems | + | |

- | and differential inclusions. Systems and Control Letters 55 (2005), pp. 45-51 (with V. Acary, B. Brogliato, A. Daniilidis). | + | 11. On the equivalence between complementarity systems, projected systems and differential inclusions. Systems and Control Letters 55 (2005), pp. 45-51 (with V. Acary, B. Brogliato, A. Daniilidis). |

+ | |||

12. A convex-analysis perspective on disjunctive cuts. Mathematical Programming 106,3 (2006) pp. 567-586 (with G. Cornuéjols). | 12. A convex-analysis perspective on disjunctive cuts. Mathematical Programming 106,3 (2006) pp. 567-586 (with G. Cornuéjols). | ||

+ | |||

13. Comparison of bundle and classical column generation. To appear in | 13. Comparison of bundle and classical column generation. To appear in | ||

Mathematical Programming (with O. Briant, Ph. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck). | Mathematical Programming (with O. Briant, Ph. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck). | ||

+ | |||

14. An inexact conic buncle variant suited to column generation. To appear in Mathematical Programming (with K.C. Kiwiel). | 14. An inexact conic buncle variant suited to column generation. To appear in Mathematical Programming (with K.C. Kiwiel). | ||

+ | |||

15. A bundle-type algorithm for routing in telecommunication data networks. | 15. A bundle-type algorithm for routing in telecommunication data networks. | ||

To appear in Computational Optimization and Applications (with A. Ouorou, G. Petrou). | To appear in Computational Optimization and Applications (with A. Ouorou, G. Petrou). | ||

+ | |||

Current research interests concern mainly convex analysis and nonsmooth optimization; they can be divided into three categories: | Current research interests concern mainly convex analysis and nonsmooth optimization; they can be divided into three categories: | ||

+ | |||

– Second-order approximation of convex functions, along the lines of Ref. 8 | – Second-order approximation of convex functions, along the lines of Ref. 8 | ||

above; this is a prerequisite to developing really fast nonsmooth optimization algorithms; | above; this is a prerequisite to developing really fast nonsmooth optimization algorithms; | ||

+ | |||

– Developing optimization software, with application to large-scale decomposable problems (see Refs. 6, 7, 10); | – Developing optimization software, with application to large-scale decomposable problems (see Refs. 6, 7, 10); | ||

+ | |||

– Establishing real communication with combinatorial optimization (Refs. 9, 12, 13), and also with nonsmooth dynamics (Ref. 11). | – Establishing real communication with combinatorial optimization (Refs. 9, 12, 13), and also with nonsmooth dynamics (Ref. 11). |

## Revision as of 15:56, 1 February 2008

Claude Lemaréchal was born in Paris in 1944. He graduated at ENSEIHT, one of the prestigious French engineering schools in Toulouse, obtained his "Doctorat d'Etat" (equivalent of today's Habilitation) in mathematics at the University of Paris-Dauphine, and spent most of his career at INRIA a reknowned French research centre for applied mathematics and computer science. There he played a major role for the specific mission of this institute; namely, to combine fundamental research with more applied work in direct connection with industry, thereby cross-fertilising both domains of activity. His field of interest is numerical optimization which he has applied to various areas including fluid mechanics, molecular design, geophysics, optimal control, and production management. He is known for his works in nonsmooth optimization and, more generally, the use of convex analysis for the development of practical optimization tools. He was awarded the Dantzig Prize of the Mathematical Programming Society in 1994.

## Abridged curriculum of Claude Lemaréchal

– French; born April 1st 1944 in Paris.

– 1967: “Ingénieur” in Applied Mathematics, Ecole Nationale Supérieure d’Electrotechnique, d’Informatique, d’Hydraulique de Toulouse.

– 1969: “Docteur-lngénieur”, University of Toulouse.

– 1980: “Docteur `es Sciences Mathématiques”, University of Paris IX.

– Present address: Institut National de Recherche en Informatique et Automatique, 655 avenue de l’Europe, 38330 Montbonnot, France.

– Former head of the Research Project Teamss “Théorie des Systems”, “Programmation Mathématique”, “Optimisation Numérique”.

– Professor at the University of Paris 1 from 1994 to 1997.

– Professor at ´ Ecole Nationale Supérieure d’Ingénieurs en Mathématiques Appliquées de Grenoble from 1999 to 2006.

– Dantzig Prize 1994.

Internationally known for his works in numerical optimization, especially
nonsmooth optimization, and its applications in different areas such as: fluid
mechanics, optimum design, crystallography, operations research, etc.
Former associate editor of: SIAM Journal on Control and Optimization,
SIAM Journal on Optimization; Mathematical Programming; Contrˆole, Optimisation et Calcul Variationnel.
Participates actively to the development of mathematical methods in various
branches of industry; particularly significant results in meteorology, electrical
production. Consultant in various applied domains where optimization is needed
(production management, networking, finance, geophysics, *etc.*).
Author of over 50 publications in international journals; some of the most significant ones are:

1. Nonsmooth Optimization. Proceedings, Pergamon Press (1978) (with R. Mifflin).

2. Convex Analysis and Minimization Algorithms. Springer Verlag, Grundlehren 305, 306 (1993) (with J.B. Hiriart-Urruty).

3. Fundamentals of Convex Analysis. Springer Verlag, Grundlehren Text Editions (2001) (with J.B. Hiriart-Urruty).

4. Numerical Optimisation: Theoretical and Practical Aspects. Springer Verlag, Universitext (2003) (with J.F. Bonnans, J. Ch. Gilbert, C. Sagastiz´abal).

5. An algorithm for minimizing convex functions. Proceedings, Information Processing ’74, Stockholm (1974).

6. Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization 7,2 (1997) 367-385 (with C. Sagastiz´abal).

7. Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming 76,3 (1997), pp. 393-410 (with C. Sagastiz´abal).

8. The U-Lagrangian af a convex function. Transactions of the AMS 352,2 (2000), pp. 711-729 (with F. Oustry and C. Sagastiz´abal).

9. Lagrangian relaxation. in: Computational Combinatorial Optimization, M. J¨unger, D. Naddef (eds.) Springer Verlag (2001), pp. 112-156.

10. A primal-proximal heuristic applied to the French unit-commitment problem. Mathematical Programming 104,1 (2005) pp. 129-152 (with L. Dubost, R. Gonzalez).

11. On the equivalence between complementarity systems, projected systems and differential inclusions. Systems and Control Letters 55 (2005), pp. 45-51 (with V. Acary, B. Brogliato, A. Daniilidis).

12. A convex-analysis perspective on disjunctive cuts. Mathematical Programming 106,3 (2006) pp. 567-586 (with G. Cornuéjols).

13. Comparison of bundle and classical column generation. To appear in Mathematical Programming (with O. Briant, Ph. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck).

14. An inexact conic buncle variant suited to column generation. To appear in Mathematical Programming (with K.C. Kiwiel).

15. A bundle-type algorithm for routing in telecommunication data networks. To appear in Computational Optimization and Applications (with A. Ouorou, G. Petrou).

Current research interests concern mainly convex analysis and nonsmooth optimization; they can be divided into three categories:

– Second-order approximation of convex functions, along the lines of Ref. 8 above; this is a prerequisite to developing really fast nonsmooth optimization algorithms;

– Developing optimization software, with application to large-scale decomposable problems (see Refs. 6, 7, 10);

– Establishing real communication with combinatorial optimization (Refs. 9, 12, 13), and also with nonsmooth dynamics (Ref. 11).