default search action
Claude Lemaréchal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j27]Michele Conforti, Gérard Cornuéjols, Aris Daniilidis
, Claude Lemaréchal, Jérôme Malick:
Cut-Generating Functions and S-Free Sets. Math. Oper. Res. 40(2): 276-391 (2015) - 2014
- [j26]Welington de Oliveira, Claudia A. Sagastizábal
Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148(1-2): 241-277 (2014) - 2013
- [j25]Florent Cadoux, Claude Lemaréchal:
Reflections on generating (disjunctive) cuts. EURO J. Comput. Optim. 1(1-2): 51-69 (2013) - [c4]Michele Conforti, Gérard Cornuéjols, Aris Daniilidis
Cut-Generating Functions. IPCO 2013: 123-132 - 2012
- [j24]Marc Fuentes, Jérôme Malick, Claude Lemaréchal:
Descentwise inexact proximal algorithms for smooth optimization. Comput. Optim. Appl. 53(3): 755-769 (2012) - 2010
- [j23]Claude Lemaréchal, Adam Ouorou, Georgios Petrou:
Robust network design in telecommunications under polytope demand uncertainty. Eur. J. Oper. Res. 206(3): 634-641 (2010)
2000 – 2009
- 2009
- [j22]Claude Lemaréchal, Adam Ouorou, Georgios Petrou:
A bundle-type algorithm for routing in telecommunication data networks. Comput. Optim. Appl. 44(3): 385-409 (2009) - [j21]Krzysztof C. Kiwiel, Claude Lemaréchal:
An inexact bundle variant suited to column generation. Math. Program. 118(1): 177-206 (2009) - 2008
- [j20]Olivier Briant
Comparison of bundle and classical column generation. Math. Program. 113(2): 299-344 (2008) - 2007
- [j19]Claude Lemaréchal:
The omnipresence of Lagrange. Ann. Oper. Res. 153(1): 9-27 (2007) - [j18]Georgios Petrou, Claude Lemaréchal, Adam Ouorou:
An approach to robust network design in telecommunications. RAIRO Oper. Res. 41(4): 411-426 (2007) - 2006
- [j17]Claude Lemaréchal:
S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004 hardback, ISBN 0 521 83378 7. Eur. J. Oper. Res. 170(1): 326-327 (2006) - [j16]Gérard Cornuéjols, Claude Lemaréchal:
A convex-analysis perspective on disjunctive cuts. Math. Program. 106(3): 567-586 (2006) - [j15]Bernard Brogliato, Aris Daniilidis
On the equivalence between complementarity systems, projected systems and differential inclusions. Syst. Control. Lett. 55(1): 45-51 (2006) - 2005
- [j14]Aris Daniilidis
On a primal-proximal heuristic in discrete optimization. Math. Program. 104(1): 105-128 (2005) - [j13]Louis Dubost, Robert Gonzalez, Claude Lemaréchal:
A primal-proximal heuristic applied to the French Unit-commitment problem. Math. Program. 104(1): 129-151 (2005) - 2003
- [j12]Claude Lemaréchal:
The omnipresence of Lagrange. 4OR 1(1): 7-25 (2003) - 2001
- [j11]Léonard Bacaud, Claude Lemaréchal, Arnaud Renaud, Claudia A. Sagastizábal
Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners. Comput. Optim. Appl. 20(3): 227-244 (2001) - [j10]Claude Lemaréchal, Arnaud Renaud:
A geometric study of duality gaps, with applications. Math. Program. 90(3): 399-427 (2001) - [c3]Claude Lemaréchal:
Lagrangian Relaxation. Computational Combinatorial Optimization 2001: 112-156
1990 – 1999
- 1997
- [j9]Claude Lemaréchal, Claudia A. Sagastizábal:
Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries. SIAM J. Optim. 7(2): 367-385 (1997) - 1996
- [j8]Claude Lemaréchal, Claudia A. Sagastizábal:
Variable metric bundle methods: From conceptual to implementable forms. Math. Program. 76: 393-410 (1996) - 1995
- [j7]J. Frédéric Bonnans, Jean Charles Gilbert
A family of variable metric proximal methods. Math. Program. 68: 15-47 (1995) - [j6]Claude Lemaréchal, Arkadii Nemirovskii
New variants of bundle methods. Math. Program. 69: 111-147 (1995) - 1993
- [j5]Rafael Correa, Claude Lemaréchal:
Convergence of some algorithms for convex minimization. Math. Program. 62: 261-275 (1993) - [c2]Claude Lemaréchal, Claudia A. Sagastizábal:
An approach to variable metric bundle methods. System Modelling and Optimization 1993: 144-162 - 1992
- [j4]Andrée Decarreau, Danielle Hilhorst, Claude Lemaréchal, Jorge Navaza:
Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography. SIAM J. Optim. 2(2): 173-197 (1992)
1980 – 1989
- 1989
- [j3]Jean Charles Gilbert
Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45(1-3): 407-435 (1989) - 1982
- [j2]Claude Lemaréchal, Robert Mifflin:
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions. Math. Program. 24(1): 241-256 (1982)
1970 – 1979
- 1974
- [j1]Claude Lemaréchal:
Note on an extension of "Davidon" methods to nondifferentiable functions. Math. Program. 7(1): 384-387 (1974) - [c1]Claude Lemaréchal:
An Algorithm for Minimizing Convex Functions. IFIP Congress 1974: 552-556
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: