M. Achache, A new primal-dual path-following method for convex quadratic programming, Computational & Applied Mathematics, vol.25, issue.1, pp.97-110, 2006.
DOI : 10.1590/S0101-82052006000100005

M. Achache, Complexity analysis and numerical implementation of a shortstep primal-dual algorithm for linear complementarity problems, Applied Mathematics and computation, vol.216, issue.7, p.18891895, 2010.

M. Anitescu, G. Lesaja, and F. A. Potra, Equivaence between dierent formulations of the linear complementarity promblem. Optimization Methods and Software, pp.3-4265290, 1997.

S. Asadi and H. Mansouri, Polynomial interior-point algorithm for P * ${(\kappa)}$ horizontal linear complementarity problems, Numerical Algorithms, vol.83, issue.3, Ser. A, p.385398, 2013.
DOI : 10.1007/s11075-012-9628-0

S. Asadi and H. Mansouri, A new full-newton step O(n) infeasible interiorpoint algorithm for P * (?)-horizontal linear complementarity problems, The Computer Science Journal of Moldova, vol.22, issue.1, p.3761, 2014.

S. Asadi, H. Mansouri, and Z. Darvay, An infeasible interior-point method with improved centering steps for monotone linear complementarity problems, Asian-European Journal of Mathematics, vol.08, issue.03, p.1550037, 2015.
DOI : 10.1142/S1793557115500370

Y. Q. Bai, G. Lesaja, C. Roos, G. Q. Wang, and M. Ghami, A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization, Journal of Optimization Theory and Applications, vol.18, issue.3, p.341359, 2008.
DOI : 10.1007/s10957-008-9389-z

S. J. Chung, A note on the complexity of LCP: the LCP is strongly npcomplete, p.792, 1979.

R. W. Cottle, A eld guide to the matrix classes found in the literature of the linear complementarity problem, Journal of Global Optimization, vol.46, issue.4, p.571580, 2010.

R. W. Cottle, J. Pang, and R. E. Stone, The linear complementarity problem, Siam, vol.60, 2009.

Z. Darvay, New interior-point algorithms in linear programming Advanced Modelling and Optimization, p.5192, 2003.

E. De-klerk and M. Negy, On the complexity of computing the handicap of a sucient matrix, Mathematical programming, vol.129, issue.2, p.383402, 2011.

M. Ghami, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, RAIRO - Operations Research, vol.42, issue.2, 2005.
DOI : 10.1051/ro:2008009

G. Gu, Full-step interior-point methods for symmetric optimization, 2009.

M. Haddou and P. Maheux, Smoothing Methods for Nonlinear Complementarity Problems, Journal of Optimization Theory and Applications, vol.48, issue.2, 2014.
DOI : 10.1007/s10957-013-0398-1
URL : https://hal.archives-ouvertes.fr/hal-00464870

T. Illés, C. Roos, and T. Terlaky, Polynomial ane-scaling algorithms for P * (?) linear complementary problems, Recent Advances in Optimization, p.119137, 1997.

F. Jarre and M. A. Saunders, An adaptive primal-dual method for linear programming, 1991.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.302311, 1984.

M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, A unied approach to interior point algorithms for linear complementarity problems, 1991.

G. Lesaja and C. Roos, Unied analysis of kernel-based interior-point methods for P * (?)-linear complementarity problems, SIAM Journal on Optimization, vol.20, issue.6, p.30143039, 2010.

H. Mansouri, Full-Newton step interior-point methods for conic optimization, 2008.

H. Mansouri, M. Zangiabadi, and M. Pirhaji, A full-Newton step infeasible-interior-point algorithm for linear complementarity problems, Nonlinear Analysis: Real World Applications, vol.12, issue.1, p.545561, 2011.
DOI : 10.1016/j.nonrwa.2010.06.039

J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A new paradigm for Primal-Dual interior-point algorithms, 2009.
DOI : 10.1515/9781400825134

J. Renegar, A mathematical view of interior-point methods in convex optimization, Siam, vol.3, 2001.
DOI : 10.1137/1.9780898718812

C. Roos, A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization, SIAM Journal on Optimization, vol.16, issue.4, p.11101136, 2006.
DOI : 10.1137/050623917

C. Roos, An improved and simplied full-newton step O(n) infeasible interior-point method for linear optimization, SIAM Journal on Optimization, vol.25, issue.1, p.102114, 2015.

C. Roos, T. Terlaky, and J. Vial, Interior point methods for linear optimization, 2006.

T. Terlaky, Interior point methods of mathematical programming, 2013.
DOI : 10.1007/978-1-4613-3449-1

G. Q. Wang, X. J. Fan, D. T. Zhu, and D. Z. Wang, New complexity analysis of a full-newton step feasible interior-point algorithm for P * (?)-lcp. Optimization Letters, p.11051119, 2015.

Y. Ye, Interior point algorithms: theory and analysis, 2011.
DOI : 10.1002/9781118032701