References
- Murty KG. On the number of solutions to the complementarity problems and spanning properties of complementarity cones. Linear Algebra Appl. 1972;5:65–108.
- Chang Y-Y. Least-index resolution of degeneracy in linear complementarity problems, Technical Report 79–14. Stanford (CA): Department of Operations Research, Stanford University; 1979.
- Cheng Y-C. On the gradient-projection method for solving the nonsymmetric linear complementarity problem. J. Optim. Theor. Appl. 1984;43:527–541.
- Cottle RC, Pang JS, Stone RE. The linear complementarity problem. New York (NY): Academic Press; 1992.
- Elfoutayeni Y, Khaladi M. Using vector divisions in solving the linear complementarity problem. J. Comput. Appl. Math. 2012;236:1919–1925.
- Kojima M, Megiddo N, Noma M, Yoshise A. A unified approach to interior point algorithms for linear complementarity problems. Vol. 538, Lecture notes in computer science; Berlin: Springer-Verlag; 1991.
- Lemke CE. Bimatrix equilibrium points and mathematical programming. Manag. Sci. 1965;11:681–689.
- Lemke CE. Some pivot schemes for the linear complementarity problem. Math. Program. Study. 1978;7:15–35.
- Mathias R, Pang J-S. Error bounds for the linear complementarity problem with a P-matrices. Linear Algebra Appl. 1990;132:123–136.
- Murty KG. Note on a bard-type scheme for solving the complementarity problem. Opsearch. 1974;11:123–130.
- Ye Y. A further result on potential reduction algorithm for the P-matrix linear complementarity problem. In: Pardalos PM, editor. Advances in optimization and parallel computing. New York (NY): North-Holland; 1992. p. 310–316.
- Phung HT, Tin TT. The continuity of the solution map in linear complementarity problems with underlying k-matrices. Optimization; 2015; 64: 839–851.