default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Charles Gilbert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Jean-Pierre Dussault
, Jean Charles Gilbert:
Exact computation of an error bound for the balanced linear complementarity problem with unique solution. Math. Program. 199(1): 1221-1238 (2023)
2010 – 2019
- 2019
- [j15]Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert:
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem. EURO J. Comput. Optim. 7(4): 359-380 (2019) - [j14]Ibtihel Ben Gharbia, Jean Charles Gilbert:
An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation. SIAM J. Matrix Anal. Appl. 40(2): 800-813 (2019) - 2017
- [j13]Jean Charles Gilbert:
On the Solution Uniqueness Characterization in the L1 Norm and Polyhedral Gauge Recovery. J. Optim. Theory Appl. 172(1): 70-101 (2017) - 2013
- [j12]Ibtihel Ben Gharbia, Jean Charles Gilbert:
An Algorithmic Characterization of P-Matricity. SIAM J. Matrix Anal. Appl. 34(3): 904-916 (2013) - 2012
- [j11]Ibtihel Ben Gharbia, Jean Charles Gilbert:
Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix. Math. Program. 134(2): 349-364 (2012)
2000 – 2009
- 2007
- [i1]Jean Charles Gilbert, Xavier Jonsson:
LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0. CoRR abs/cs/0703025 (2007) - 2005
- [j10]Jean Charles Gilbert, Clóvis C. Gonzaga, Elizabeth W. Karas:
Examples of ill-behaved central paths in convex optimization. Math. Program. 103(1): 63-94 (2005) - 2002
- [j9]Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou:
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. Math. Program. 92(3): 393-424 (2002) - 2000
- [j8]Paul Armand, Jean Charles Gilbert:
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method. Comput. Optim. Appl. 16(2): 121-158 (2000) - [j7]Richard H. Byrd, Jean Charles Gilbert, Jorge Nocedal:
A trust region method based on interior point techniques for nonlinear programming. Math. Program. 89(1): 149-185 (2000) - [j6]Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou:
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems. SIAM J. Optim. 11(1): 199-222 (2000)
1990 – 1999
- 1997
- [j5]Jean Charles Gilbert:
On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization. SIAM J. Optim. 7(3): 780-813 (1997) - 1995
- [j4]J. Frédéric Bonnans, Jean Charles Gilbert, Claude Lemaréchal, Claudia A. Sagastizábal:
A family of variable metric proximal methods. Math. Program. 68: 15-47 (1995) - 1992
- [j3]Jean Charles Gilbert, Jorge Nocedal:
Global Convergence Properties of Conjugate Gradient Methods for Optimization. SIAM J. Optim. 2(1): 21-42 (1992) - 1991
- [j2]Jean Charles Gilbert:
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization. Math. Program. 50: 1-28 (1991)
1980 – 1989
- 1989
- [j1]Jean Charles Gilbert, Claude Lemaréchal:
Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45(1-3): 407-435 (1989)
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-25 05:51 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:
