Version française
Theory
Algorithmics

Polyhedral Newtonmin algorithms for complementarity problems,
with J.P. Dussault, M. Frappier.
Mathematical Programming (in revision).
Polyhedral Newtonmin algorithms for complementarity problems  The full report,
with J.P. Dussault, M. Frappier.
HAL report uploaded on the 15th of May 2023.

A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newtonmin algorithm for solving the linear complementarity problem [doi],
with J.P. Dussault, M. Frappier.
EURO Journal on Computational Optimization, 7:4 (2019) 359380.

An algorithmic characterization of Pmatricity II: adjustments, refinements, and validation [doi],
with I. Ben Gharbia.
SIAM Journal on Matrix Analysis and Applications, 40:2 (2019) 800813.

An algorithmic characterization of Pmatricity,
with I. Ben Gharbia.
SIAM Journal on Matrix Analysis and Applications, 34 (2013) 904916.

Nonconvergence of the plain Newtonmin algorithm for linear complementarity problems with a Pmatrix,
with I. Ben Gharbia.
Mathematical Programming, 134 (2012) 349364.
Nonconvergence of the plain Newtonmin algorithm for linear complementarity problems with a Pmatrix  The full report,
with I. Ben Gharbia.
Applications
Code