I. Ben-gharbia and J. Gilbert, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P -matrix -The full report, INRIA, BP 105, 78153, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00442293

I. Ben-gharbia and J. Gilbert, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P -matrix, Mathematical Programming, vol.134, pp.349-364, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00442293

I. Ben-gharbia and J. Gilbert, An algorithmic characterization of P-matricity, SIAM Journal on Matrix Analysis and Applications, vol.34, p.14, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00713330

I. Ben-gharbia and J. Jaffré, Gas phase appearance and disappearance as a problem with complementarity constraints, Mathematics and Computers in Simulation, vol.99, issue.2, pp.28-36, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00641621

M. Bergounioux, M. Haddou, M. Hintermüller, and K. Kunisch, A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems, SIAM Journal on Optimization, vol.11, pp.495-521, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00022028

M. Bergounioux, K. Ito, and K. Kunisch, Primal-dual strategy for constrained optimal control problems, SIAM Journal on Control and Optimization, vol.37, pp.1176-1194, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00022023

J. Bonnans, J. Gilbert, C. Lemaréchal, and C. Sagastizábal, Optimisation Numé-rique -Aspects théoriques et pratiques, no. 27 in Mathématiques et Applications, 1997.

J. Bonnans, J. Gilbert, C. Lemaréchal, and C. Sagastizábal, Numerical Optimization -Theoretical and Practical Aspects, 2006.

R. Byrd, G. Chin, J. Nocedal, and F. Oztoprak, A family of second-order methods for convex ? 1 -regularized optimization, Mathematical Programming, pp.1-33, 2015.

R. Chandrasekaran, A special case of the complementary pivot problem, Opsearch, vol.7, issue.3, pp.263-268, 1970.

A. Chiche and J. Gilbert, How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem, Journal of Convex Analysis, vol.23, issue.2, pp.425-459, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01057577

R. Cottle, J. Pang, and R. Stone, The Linear Complementarity Problem, Classics in Applied Mathematics, vol.2, issue.60, 2009.

F. Curtis, Z. Han, and D. Robinson, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization, Computational Optimization and Applications, vol.60, pp.311-341, 2015.

F. Delbos and J. Gilbert, Global linear convergence of an augmented Lagrangian algorithm for solving convex quadratic optimization problems, Journal of Convex Analysis, vol.12, issue.2, pp.45-69, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00071556

J. Dussault, M. Frappier, and J. Gilbert, 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 (submitted), issue.3, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01806399

M. Ferris and J. Pang, Complementarity and Variational Problems -State of the Art, Proceedings of the International Conference on Complementarity Problems, 1995.

M. Ferris and J. Pang, Engineering and economic applications of complementarity problems, SIAM Review, vol.39, issue.2, pp.669-713, 1997.

M. Fiedler and V. Pták, On matrices with nonpositive off-diagonal elements and principal minors, Czechoslovak Mathematics Journal, vol.12, issue.8, pp.382-400, 1962.

A. Fischer and C. Kanzow, On finite termination of an iterative method for linear complementarity problems, Mathematical Programming, vol.74, pp.279-292, 1996.

P. Harker and J. Pang, A damped-Newton method for the linear complementarity problem, in Computational Solution of Nonlinear Systems of Equations, Lecture in Applied Mathematics, issue.26, 1990.

M. Hintermüller, K. Ito, and K. Kunisch, The primal-dual active set strategy as a semismooth Newton method, SIAM Journal on Optimization, vol.13, pp.865-888, 2003.

P. Hungerländer, J. Júdice, and F. Rendl, A recursive semi-smooth Newton method for linear complementarity problems, 2017.

P. Hungerländer and F. Rendl, A feasible active set method for strictly convex quadratic problems with simple bounds, SIAM Journal on Optimization, vol.25, pp.1633-1659, 2015.

P. Hungerländer and F. Rendl, An infeasible active set method with combinatorial line search for convex quadratic problems with bound constraints, 2016.

C. Kanzow, Inexact semismooth Newton methods for large-scale complementarity problems, Optimization Methods and Software, vol.19, pp.309-325, 2004.

M. Kojima and S. Shindo, Extension of Newton and quasi-Newton methods to systems of PC 1 equations, Journal of Operations Research Society of Japan, vol.29, issue.3, pp.352-375, 1986.

K. Kunisch and F. Rendl, An infeasible active set method for quadratic problems with simple bounds, SIAM Journal on Optimization, vol.14, pp.35-52, 2003.

S. Lang, Linear algebra, Undergraduate Texts in Mathematics, issue.8, 1987.

L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations, vol.18, pp.227-244, 1993.

L. Qi and J. Sun, A nonsmooth version of Newton's method, Mathematical Programming, vol.58, pp.353-367, 1993.

S. Roman, Graduate Texts in Mathematics, 2008.

H. Samelson, R. Thrall, and O. Wesler, A partition theorem for the Euclidean n-space, Proceedings of the American Mathematical Society, vol.9, issue.2, pp.805-807, 1958.