Author:
Das A. K.,Jana R.,Deepmala
Reference15 articles.
1. Crouzeix, J.P., Komlósi, S.: The linear complementarity problem and the class of generalized positive subdefinite matrices. In: Optimization Theory, pp. 45–63. Springer, US (2001)
2. Den Hertog, D.: Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity, vol. 277. Springer Science & Business Media (2012)
3. Fathi, Y.: Computational complexity of LCPs associated with positive definite symmetric matrices. Math. Program. 17(1), 335–344 (1979)
4. Khachiyan, L.G.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53–72 (1980)
5. Kojima, M., Megiddo, N., Ye, Y.: An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54(1–3), 267–279 (1992)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献