[1]  Kojima M, Megiddo N, Noma T, et al. A Unified Approach to Interior-point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science. Berlin, Heidelberg, New York: Springer-Verlag, 1991

[2]  Frenk H, Roos K, Terlaky T, et al. High Performance Optimization. Dordrecht: Kluwer Academic Publishers, 1999

[3]  Kojima M, Megiddo N, Mizuno S. A primal-dual infeasible interior-point algorithms for linear programming. Math Program, 1993, 61(3): 263--280

[4]  Mizuno S. Polynomiality of infeasible interior-point algorithms for linear programming. Math Program, 1994, 67(1--3): 109--119

[5]  Zhang Y. On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem. SIAM J Optim, 1994, 4(1): 208--227

[6]  Roos C. A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J Optim, 2006,  6(1): 1110--1136

[7]  Gu G, Mansouri H, Roos C, et al. Improved full-Newton step O(nL) infeasible interior-point method for linear optimization. J Optim Theory Appl, 2010, 145(2): 271--288

[8] Mansouri~H, Zhangiabadi~M, Pirhaji~M. A full-Newton step O(n) infeasible-interior-point algorithm for linear
complementarity problems. Nonlinear Analysis: Real World Applications, 2011, 12(1): 545--561