Some numerical experiments with variable-storage quasi-Newton algorithms. - Jean Charles Gilbert; Claude Lemaréchal (Math. Program., 1989)

Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization. - Jean Charles Gilbert (Math. Program., 1991)

Global Convergence Properties of Conjugate Gradient Methods for Optimization. - Jean Charles Gilbert; Jorge Nocedal (SIAM J. Optim., 1992)

A family of variable metric proximal methods. - J. Frédéric Bonnans; Jean Charles Gilbert; Claude Lemaréchal; Claudia A. Sagastizábal (Math. Program., 1995)

On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization. - Jean Charles Gilbert (SIAM J. Optim., 1997)

A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method. - Paul Armand; Jean Charles Gilbert (Comput. Optim. Appl., 2000)

A trust region method based on interior point techniques for nonlinear programming. - Richard H. Byrd; Jean Charles Gilbert; Jorge Nocedal (Math. Program., 2000)

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems. - Paul Armand; Jean Charles Gilbert; Sophie Jan-Jégou (SIAM J. Optim., 2000)

A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. - Paul Armand; Jean Charles Gilbert; Sophie Jan-Jégou (Math. Program., 2002)

Examples of ill-behaved central paths in convex optimization. - Jean Charles Gilbert; Clóvis C. Gonzaga; Elizabeth W. Karas (Math. Program., 2005)

LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0 - Jean Charles Gilbert; Xavier Jonsson (CoRR, 2007)

Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix. - Ibtihel Ben Gharbia; Jean Charles Gilbert (Math. Program., 2012)

An Algorithmic Characterization of P-Matricity. - Ibtihel Ben Gharbia; Jean Charles Gilbert (SIAM J. Matrix Anal. Appl., 2013)

On the Solution Uniqueness Characterization in the L1 Norm and Polyhedral Gauge Recovery. - Jean Charles Gilbert (J. Optim. Theory Appl., 2017)

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. - Jean-Pierre Dussault; Mathieu Frappier; Jean Charles Gilbert (EURO J. Comput. Optim., 2019)

An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation. - Ibtihel Ben Gharbia; Jean Charles Gilbert (SIAM J. Matrix Anal. Appl., 2019)

Exact computation of an error bound for the balanced linear complementarity problem with unique solution. - Jean-Pierre Dussault; Jean Charles Gilbert (Math. Program., 2023)

On the B-differential of the componentwise minimum of two affine vector functions. - Jean-Pierre Dussault; Jean Charles Gilbert; Baptiste Plaquevent-Jourdain (Math. Program. Comput., 2025)