Claude Lemaréchal

Claude Lemaréchal's AcademicInfluence.com Rankings

Claude Lemaréchal

Mathematics

#7552

World Rank

#10249

Historical Rank

Measure Theory

#2281

World Rank

#2733

Historical Rank

mathematics Degrees

Claude Lemaréchal

Computer Science

#10150

World Rank

#10645

Historical Rank

Database

#7104

World Rank

#7352

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Claude Lemaréchal's Degrees

PhD Mathematics Université Paris Cité

Why Is Claude Lemaréchal Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Claude Lemaréchal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Convex analysis and minimization algorithms (1993) (3096)
Some numerical experiments with variable-storage quasi-Newton algorithms (1989) (766)
Fundamentals of Convex Analysis (2004) (712)
New variants of bundle methods (1995) (452)
Lagrangian Relaxation (2000) (384)
Numerical Optimization: Theoretical and Practical Aspects (Universitext) (2006) (334)
The watchdog technique for forcing convergence in algorithms for constrained optimization (1982) (331)
Convergence of some algorithms for convex minimization (1993) (270)
An extension of davidon methods to non differentiable problems (1975) (239)
Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries (1997) (235)
Variable metric bundle methods: From conceptual to implementable forms (1997) (186)
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION (1981) (177)
Nondifferentiable optimization (1989) (141)
An Algorithm for Minimizing Convex Functions (1974) (137)
On the equivalence between complementarity systems, projected systems and differential inclusions (2006) (135)
A family of variable metric proximal methods (1995) (132)
Comparison of bundle and classical column generation (2008) (129)
Convex proximal bundle methods in depth: a unified analysis for inexact oracles (2014) (124)
The -Lagrangian of a convex function (1999) (123)
Nonsmooth Optimization and Descent Methods (1978) (108)
Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners (2001) (100)
A geometric study of duality gaps, with applications (2001) (99)
Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization (1999) (94)
A primal-proximal heuristic applied to the French Unit-commitment problem (2005) (92)
A view of line-searches (1981) (79)
Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography (1992) (77)
An approach to variable metric bundle methods (1993) (63)
Chapter VII Nondifferentiable optimization (1989) (62)
The omnipresence of Lagrange (2007) (59)
A formulation of the linear discrete Coulomb friction problem via convex optimization (2011) (53)
Bundle methods applied to the unit-commitment problem (1996) (52)
Cut-Generating Functions and S-Free Sets (2015) (52)
SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint (2001) (46)
An inexact bundle variant suited to column generation (2009) (40)
A convex-analysis perspective on disjunctive cuts (2006) (39)
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (1982) (37)
A Condensed Introduction to Bundle Methods in Nonsmooth Optimization (1994) (36)
Trends in Mathematical Optimization (1987) (35)
On a primal-proximal heuristic in discrete optimization (2005) (32)
An introduction to the theory of nonsmooth optimization (1986) (32)
Nonsmooth Algorithms to Solve Semidefinite Programs (1999) (31)
Constructing Bundle Methods for Convex Optimization (1986) (30)
Approximation to a set-valued mapping, I: A proposal (1986) (30)
The eclipsing concept to approximate a multi-valued mapping (1991) (29)
On the Equivalence Between Complementarity Systems, Projected Systems and Unilateral Differential Inclusions (2004) (28)
A bundle-type algorithm for routing in telecommunication data networks (2009) (27)
Descentwise inexact proximal algorithms for smooth optimization (2012) (23)
Some remarks on the construction of higher order algorithms in convex optimization (1983) (22)
Nonsmooth optimization : proceedings of a IIASA workshop, March 28-April 8, 1977 (1978) (21)
The short-term electricity production management problem at EDF (2010) (21)
An approach to robust network design in telecommunications (2007) (21)
More Than First-Order Developments of Convex Functions: Primal-Dual Relations (20)
Practical aspects of the Moreau-Yosida regularization I : theoretical properties (1994) (20)
Robust network design in telecommunications under polytope demand uncertainty (2010) (17)
The omnipresence of Lagrange (2003) (15)
MORCAD, an Object‐Oriented Molecular Modelling Package Running on IBM RS/6000 and SGI 4Dxxx Workstations (1991) (12)
Optimization and Applications (2005) (12)
Note on an extension of “Davidon” methods to nondifferentiable functions (1974) (11)
S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004 hardback, ISBN 0 521 83378 7 (2006) (10)
Nondifferentiable Optimisation Subgradient and ε — Subgradient Methods (1976) (9)
Reflections on generating (disjunctive) cuts (2013) (9)
Cut-Generating Functions (2013) (9)
Convex Functions of One Real Variable (1993) (9)
An inexact conic bundle variant suited to column generation (2006) (6)
Some Theory of Nonsmooth Optimization (2003) (6)
Conjugacy in Convex Analysis (1993) (6)
Second-order cone optimization for unilateral contact with Coulomb friction (2009) (5)
On the ab initio phase determination by maximum entropy (1991) (5)
Mathematical programming in use (1978) (4)
Optimisation non Differentiable: Methodes de Faisceaux (1979) (4)
GLOBAL AND SUPERLINEAR C ONVERGENCE OF AN (1982) (3)
Computing Economic Equilibria through Nonsmooth Optimization (1978) (3)
Bundle Methods, Cutting-Plane Algorithms and σ-Newton Directions (1985) (3)
Growth Conditions and U-Lagrangians (2001) (3)
Methods of Descent for Nondifferentiable Optimization (Krzysztof C. Kiwiel) (1988) (3)
Acceleration of the Cutting-Plane Algorithm: Primal Forms of Bundle Methods (1993) (3)
Abstract Duality for Practitioners (1993) (3)
Proximal Convexification Procedures in Combinatorial Optimization (2002) (2)
Local Methods for Problems with Equality Constraints (2003) (2)
ATTEMPTS TO APPROXIMATE A SET-VALUED MAPPING (1985) (2)
Introduction to Optimization Algorithms (1993) (2)
Differentiability of a Support Function of an E-Subgradient (1980) (2)
One-Step Methods (2003) (1)
Local Methods for Problems with Equality and Inequality Constraints (2003) (1)
On Approximating a Set-Valued Function Locally. (1985) (1)
Nonsmooth Optimization: Use of the Code DYNEPS (1980) (1)
A non-smooth optimization method for the friction problem in computational mechanics (2008) (1)
A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem (2015) (1)
THE PERTURBED GENERALIZED TIKHONOV’S ALGORITHM (2009) (1)
Linearly Constrained Optimization and Simplex Algorithm (2003) (0)
Non-Feasible Algorithms (2003) (0)
The perturbed generalized proximal point algorithm (2017) (0)
Sublinearity and Support Functions (1993) (0)
Trends in mathematical optimization : 4th French-German Conference on Optimization (1988) (0)
Globalization by Line-Search (2003) (0)
An algorithm for Coulomb's frictional contact (2008) (0)
Approximate Subdifferentials of Convex Functions (1993) (0)
Introduction: Notation, Elementary Results (2001) (0)
Port of the 'Scilab' 'n1qn1' Module for Unconstrained BFGS Optimization [R package n1qn1 version 6.0.1-10] (2020) (0)
Mathematisches Forschungsinstitut Oberwolfach Report No . 2 / 2005 Optimization and Applications (2005) (0)
Some Methods in Nonsmooth Optimization (2003) (0)
Complexity of Linear Optimization Problems with Integer Data (2003) (0)
Linear Monotone Complementarity and Associated Vector Fields (2003) (0)
Gradient type optimization methods to solve differential games applied to tri-dimensional air-to-air combats (1980) (0)
Necessary conditions for local optimality in d . c . programming (2008) (0)
Inner Construction of the Subdifferential: Towards Implementing Descent Methods (1993) (0)
Convex Functions of Several Variables (1993) (0)
New Results - Heuristique primale-duale en optimisation combinatoire (2002) (0)
Modeling, Simulating, Controlling Non-Regular Dynamical Systems (2004) (0)
Quasi-Newton Versions (2003) (0)
Descentwise inexact proximal algorithms for smooth optimization (2012) (0)
Descent Theory for Convex Minimization: The Case of Complete Information (1993) (0)
Decomposition and Duality (2003) (0)
Predictor-Corrector Algorithms (2003) (0)
Bundle Methods. The Quest of Descent (2003) (0)
Constrained Convex Minimization Problems: Minimality Conditions, Elements of Duality Theory (1993) (0)
Duality Without Tears (1993) (0)
Subdifferentials of Finite Convex Functions (1993) (0)
Ontheequivalencebetweencomplementaritysystems,projectedsystems anddifferentialinclusions ! (2006) (0)
Dynamic Construction of Approximate Subdifferentials: Dual Form of Bundle Methods (1993) (0)
A Class of variable metric bundle methods (1993) (0)
Inner Construction of the Approximate Subdifferential: Methods of ε-Descent (1993) (0)
Convex proximal bundle methods in depth: a unified analysis for inexact oracles (2014) (0)

This paper list is powered by the following services:

Claude Lemaréchal's Academic­Influence.com Rankings

Claude Lemaréchal's Degrees

Why Is Claude Lemaréchal Influential?

Claude Lemaréchal's Published Works

Published Works

Claude Lemaréchal's AcademicInfluence.com Rankings