Jean Charles Gilbert
Orcid: 0000-0002-0375-4663
According to our database1,
Jean Charles Gilbert
authored at least 17 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Exact computation of an error bound for the balanced linear complementarity problem with unique solution.
Math. Program., May, 2023
2019
An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation.
SIAM J. Matrix Anal. Appl., 2019
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., 2019
2017
On the Solution Uniqueness Characterization in the L1 Norm and Polyhedral Gauge Recovery.
J. Optim. Theory Appl., 2017
2013
2012
Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix.
Math. Program., 2012
2007
LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0
CoRR, 2007
2005
2002
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach.
Math. Program., 2002
2000
SIAM J. Optim., 2000
Math. Program., 2000
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method.
Comput. Optim. Appl., 2000
1997
On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization.
SIAM J. Optim., 1997
1995
1992
SIAM J. Optim., 1992
1991
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization.
Math. Program., 1991
1989
Math. Program., 1989