In this article, we study the interior-point algorithm for solving linear complementarity problems, published by Xiaouje Ma, Hongwei Liu, Jianke Zhang and Weijie Cong from the implementation point of view. The algorithm was implemented in C++ programming language, thus supporting the effectiveness of the method. Despite the fact that the theoretical results refer only to the monotone linear complementarity problem, practical testing showed that the algorithm also works well in more general cases.
If the inline PDF is not rendering correctly, you can download the PDF file here.
 Roos C., Terlaky T., Vial. J.-Ph.: Theory and Algorithms for Linear Optimization. Springer, NY, USA, 2005.
 Wright. S. J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia, USA, 1997.
 Ye. Y.: Interior Point Algorithms, Theory and Analysis. John Wiley & Sons, Chichester, UK, 1997/3. (1997)
 Kojima M., Megiddo N., Noma T., Yoshise A.: A Unifed Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science 538, Springer Verlag, Berlin, Germany, 1991.
 Ai. W.: Neighborhood-following algorithm for linear programming. Sci. China serie A, 47. (2004) 812 – 820.
 Ai W., Zhang S.: An O(√nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM Journal on Optimization 16/2. (2005) 400–417. https://doi.org/10.1137/040604492
 Ma X., Liu H., Zhang J., Cong W.: On superlinear and O(√nL) convergence of a path-following algorithm for monotone linear complementarity problems in a wide neighborhood. Numerical Functional Analysis and Optimization, 38/5. (2017) 627–640. https://doi.org/10.1080/01630563.2017.1297824
 Darvay Zs., Takó I.: Computational comparison of primal-dual algorithms based on a new software. unpublished manuscript. (2012)
 Harker P. T., Pang J. S.: A damped Newton method for linear complementarity problem. In: Simulation an Optimization of Large Systems, Lectures on Applied Mathematics, AMS, Providence, RI, 26. (1990) 265–284.