Claude Lemaréchal

According to our database1, Claude Lemaréchal authored at least 30 papers between 1974 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
Cut-Generating Functions and <i>S</i>-Free Sets.
Math. Oper. Res., 2015

2014
Convex proximal bundle methods in depth: a unified analysis for inexact oracles.
Math. Program., 2014

2013
Reflections on generating (disjunctive) cuts.
EURO J. Comput. Optim., 2013

Cut-Generating Functions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
Descentwise inexact proximal algorithms for smooth optimization.
Comput. Optim. Appl., 2012

2010
Robust network design in telecommunications under polytope demand uncertainty.
Eur. J. Oper. Res., 2010

2009
An inexact bundle variant suited to column generation.
Math. Program., 2009

A bundle-type algorithm for routing in telecommunication data networks.
Comput. Optim. Appl., 2009

2008
Comparison of bundle and classical column generation.
Math. Program., 2008

2007
An approach to robust network design in telecommunications.
RAIRO Oper. Res., 2007

The omnipresence of Lagrange.
Ann. Oper. Res., 2007

2006
On the equivalence between complementarity systems, projected systems and differential inclusions.
Syst. Control. Lett., 2006

A convex-analysis perspective on disjunctive cuts.
Math. Program., 2006

S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004 hardback, ISBN 0 521 83378 7.
Eur. J. Oper. Res., 2006

2005
A primal-proximal heuristic applied to the French Unit-commitment problem.
Math. Program., 2005

On a primal-proximal heuristic in discrete optimization.
Math. Program., 2005

2001
A geometric study of duality gaps, with applications.
Math. Program., 2001

Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners.
Comput. Optim. Appl., 2001

Lagrangian Relaxation.
Proceedings of the Computational Combinatorial Optimization, 2001

1997
Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries.
SIAM J. Optim., 1997

1996
Variable metric bundle methods: From conceptual to implementable forms.
Math. Program., 1996

1995
New variants of bundle methods.
Math. Program., 1995

A family of variable metric proximal methods.
Math. Program., 1995

1993
Convergence of some algorithms for convex minimization.
Math. Program., 1993

An approach to variable metric bundle methods.
Proceedings of the System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, 1993

1992
Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography.
SIAM J. Optim., 1992

1989
Some numerical experiments with variable-storage quasi-Newton algorithms.
Math. Program., 1989

1982
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions.
Math. Program., 1982

1974
Note on an extension of "Davidon" methods to nondifferentiable functions.
Math. Program., 1974

An Algorithm for Minimizing Convex Functions.
Proceedings of the Information Processing, 1974


  Loading...