Jean Charles Gilbert

19 papers Journal 19
YearRankTypeTitle / Venue / Authors
2026 J jnl
Polyhedral Newton-min algorithms for complementarity problems.
Math. Program.
Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert
2025 J jnl
On the B-differential of the componentwise minimum of two affine vector functions.
Math. Program. Comput.
Jean-Pierre Dussault, Jean Charles Gilbert, Baptiste Plaquevent-Jourdain
2023 J jnl
Exact computation of an error bound for the balanced linear complementarity problem with unique solution.
Math. Program.
Jean-Pierre Dussault, Jean Charles Gilbert
2019 J jnl
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.
Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert
2019 J jnl
An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation.
SIAM J. Matrix Anal. Appl.
Ibtihel Ben Gharbia, Jean Charles Gilbert
2017 J jnl
On the Solution Uniqueness Characterization in the L1 Norm and Polyhedral Gauge Recovery.
J. Optim. Theory Appl.
Jean Charles Gilbert
2013 J jnl
An Algorithmic Characterization of P-Matricity.
SIAM J. Matrix Anal. Appl.
Ibtihel Ben Gharbia, Jean Charles Gilbert
2012 J jnl
Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix.
Math. Program.
Ibtihel Ben Gharbia, Jean Charles Gilbert
2007 J jnl
LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0
CoRR
Jean Charles Gilbert, Xavier Jonsson
2005 J jnl
Examples of ill-behaved central paths in convex optimization.
Math. Program.
Jean Charles Gilbert, Clóvis C. Gonzaga, Elizabeth W. Karas
2002 J jnl
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach.
Math. Program.
Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou
2000 J jnl
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems.
SIAM J. Optim.
Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou
2000 J jnl
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method.
Comput. Optim. Appl.
Paul Armand, Jean Charles Gilbert
2000 J jnl
A trust region method based on interior point techniques for nonlinear programming.
Math. Program.
Richard H. Byrd, Jean Charles Gilbert, Jorge Nocedal
1997 J jnl
On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization.
SIAM J. Optim.
Jean Charles Gilbert
1995 J jnl
A family of variable metric proximal methods.
Math. Program.
J. Frédéric Bonnans, Jean Charles Gilbert, Claude Lemaréchal, Claudia A. Sagastizábal
1992 J jnl
Global Convergence Properties of Conjugate Gradient Methods for Optimization.
SIAM J. Optim.
Jean Charles Gilbert, Jorge Nocedal
1991 J jnl
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization.
Math. Program.
Jean Charles Gilbert
1989 J jnl
Some numerical experiments with variable-storage quasi-Newton algorithms.
Math. Program.
Jean Charles Gilbert, Claude Lemaréchal