Numerical Results for the General Linear Complementarity Problem

Open access

Abstract

In this article we discuss the interior-point algorithm for the general complementarity problems (LCP) introduced by Tibor Illés, Marianna Nagy and Tamás Terlaky. Moreover, we present a various set of numerical results with the help of a code implemented in the C++ programming language. These results support the efficiency of the algorithm for both monotone and sufficient LCPs.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] Illés T. Nagy M. Terlaky T.: A polynomial path-following interior point algorithm for general linear complementarity problems. Journal of Global Optimization 47/3. (2010) 329–342. https://doi.org/10.1007/s10898-008-9348-0

  • [2] Illés T. Nagy M. Terlaky T.: EP Theorem for Dual Linear Complementarity Problems. Journal of Optimization Theory and Applications 140/2. (2009) 233–238. https://doi.org/10.1007/s10957-008-9440-0

  • [3] Illés T. Nagy M. Terlaky T.: Polynomial Interior Point Algorithms for General Linear Complementarity Problems. Algorithmic Operations Research 5. (2010) 1–12.

  • [4] Kojima M. Megiddo N. Noma T. Yoshise A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science 538 Springer Verlag Berlin Germany. (1991)

  • [5] Darvay Zs. Takó I.: Computational comparison of primal-dual algorithms based on a new software. unpublished manuscript. (2012)

  • [6] Morapitiye S.: Sufficient Matrices. (accessed on 12 February 2019). http://math.bme.hu/~sunil/su-matrices/

  • [7] Darvay Zs. Illés T. Povh J. Rigó P. R.: Predictor-corrector interior-point algorithm for sufficient linear complementarity problems based on a new search direction. manuscript. (2019)

  • [8] Hock W. Shittkowski K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems 187. Springer Berlin (1981) https://doi.org/10.1007/978-3-642-48320-2

  • [9] de Klerk E. E.-Nagy M.: On the complexity of computing the handicap of a sufficient matrix. Mathematical Programmming Serie A 129. (2011) 383–402. https://doi.org/10.1007/s10107-011-0465-z

Search
Journal information
Metrics
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 65 65 11
PDF Downloads 43 43 9