Access content directly

# Jean Charles Gilbert

44
Documents

## Publications

### Exact computation of an error bound for the balanced linear complementarity problem with unique solution

Mathematical Programming, Series A, In press
Journal articles

### An algorithmic characterization of P-matricity II: adjustments, refinements, and validation

SIAM Journal on Matrix Analysis and Applications, 2019, 40 (2), pp.800-813. ⟨10.1137/18M1168522⟩
Journal articles

### 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 Journal on Computational Optimization, 2019, 7 (4), pp.22. ⟨10.1007/s13675-019-00116-6⟩
Journal articles

### How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem

Journal of Convex Analysis, 2016, 23 (2)
Journal articles

### On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery

Journal of Optimization Theory and Applications, 2016, 1 (1), pp.1-32. ⟨10.1007/s10957-016-1004-0⟩
Journal articles

### Application of the Moment-SOS Approach to Global Optimization of the OPF Problem

IEEE Transactions on Power Systems, 2014, 30 (1), pp.8. ⟨10.1109/TPWRS.2014.2320819⟩
Journal articles

### An algorithmic characterization of P-matricity

SIAM Journal on Matrix Analysis and Applications, 2013, 34, pp.904-916. ⟨10.1137/120883025⟩
Journal articles

### The genomic sequence and analysis of the swine major histocompatibility complex.

Genomics, 2006, 88, pp.96-110
Journal articles

### A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach

Mathematical Programming, 2002, 92 (3), pp.393-424. ⟨10.1007/s101070100283⟩
Journal articles

### A feasible BFGS interior point algorithm for solving convex minimization problems

SIAM Journal on Optimization, 2000, 11 (1), pp.199-222. ⟨10.1137/S1052623498344720⟩
Journal articles

### A dedicated constrained optimization method for 3D reflexion tomography

EAGE 66th Conference & Exhibition, Jun 2004, Paris, France
Conference papers

### Higher order time stepping for second order hyperbolic problems and optimal CFL conditions

Partial Differential Equations : Modeling and Numerical Simulation, 16, Springer, pp.67-93, 2008, 978-1-4020-8757-8. ⟨10.1007/978-1-4020-8758-5_4⟩
Book sections

### Exact computation of an error bound for the balanced linear complementarity problem with unique solution - The full report

[Research Report] Inria Paris et Université de Sherbrooke, Canada. 2022
Reports

### Polyhedral Newton-min algorithms for complementarity problems

[Research Report] Inria Paris; Université de Sherbrooke (Québec, Canada). 2019
Reports

### Plea for a semidefinite optimization solver in complex numbers – The full report

[Research Report] INRIA Paris; LAAS. 2017, pp.46
Reports

### Equivalent $R$-linear and $C$-linear systems of equations

[Research Report] INRIA Paris. 2017
Reports

### Plea for a semidefinite optimization solver in complex numbers

[Research Report] Inria Paris. 2017, pp.35
Reports

### Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix --- The full report.

[Research Report] RR-7160, INRIA. 2012, pp.19
Reports

### SQPpro - A solver of nonlinear optimization problems, using an SQP approach

[Technical Report] RT-0378, INRIA. 2009, pp.24
Reports

### QPAL -- A solver of convex quadratic optimization problems, using an augmented Lagrangian approach

[Technical Report] RT-0377, INRIA. 2009, pp.22
Reports

### Organization of the Modulopt collection of optimization problems in the Libopt environment -- Version 1.0

[Technical Report] RT-0329, INRIA. 2007, pp.20
Reports

### LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0

[Technical Report] RT-0331, INRIA. 2007, pp.35
Reports

### Global linear convergence of an augmented Lagrangian algorithm for solving convex quadratic optimization problems

[Research Report] RR-5028, INRIA. 2003
Reports

### Examples of Ill-Behaved Central Paths in Convex Optimization

[Research Report] RR-4179, INRIA. 2001
Reports

### A truncated SQP algorithm for solving nonconvex equality constrained optimization problems

[Research Report] RR-4346, INRIA. 2001
Reports

### A BFGS-IP Algorithm for Solving Strongly Convex Optimization Problems with Feasibility Enforced by an Exact Penalty Approach

[Research Report] RR-4087, INRIA. 2000
Reports

### A Feasible BFGS Interior Point Algorithm for Solving Strongly Convex Minimization Problems

[Research Report] RR-3500, INRIA. 1998
Reports

### Applicabilité de la différentiation automatique à un système d'équations aux dérivées partielles régissant les phénomènes thermohydrauliques dans un tube chauffant

RR-2795, INRIA. 1996
Reports

### A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming

[Research Report] RR-2896, INRIA. 1996
Reports

### A Piecewise Line-Search Technique for Maintaining the Positive Definiteness of the Matrices in the SQP Method

[Research Report] RR-2615, INRIA. 1995
Reports

### Superlinear convergence of a reduced BFGS method with piecewise line-search and update criterion

[Research Report] RR-2140, INRIA. 1993
Reports

### On the realization of the wolfe conditions in reduced quasi-Newton methods for equality constrained optimization

[Research Report] RR-2127, INRIA. 1993
Reports

### A Family of variable metric proximal methods

[Research Report] RR-1851, INRIA. 1993
Reports

### La Differentiation automatique de fonctions representees par des programmes

[Rapport de recherche] RR-1557, INRIA. 1991
Reports

### Global convergence properties of conjugate gradient methods for optimization

RR-1268, INRIA. 1990
Reports

### Une methode a metrique variable reduite en optimisation avec contraintes d'egalite non lineaires

RR-0482, INRIA. 1986
Reports

### On the local and global convergence of a reduced quasi-Newton method

RR-0565, INRIA. 1986
Reports