Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference41 articles.
1. B.H. Ahn, “Iterative methods for linear complementarity problem with uperbounds and lower-bounds,” Math. Programming, vol. 26, pp. 265–315, 1983.
2. E.D. Andersen and Y. Ye, “On a homogeneous algorithm for the monotone complementarity problem,” Math. Programming, vol. 84, pp. 375–399, 1999.
3. M. Anitescu, G. Lesaja and F.A. Potra, “An infeasible-interior-point predictor-corrector algorithm for the P*-geometric LCP,” Appl. Math. Optim., vol. 36, pp. 203–228, 1997.
4. J.V. Burke and S. Xu, “The global linear convergence of a non-interior path-following algorithm for linear complementarity problems,” Math. Oper. Res., vol. 23, pp. 719–734, 1998.
5. J.V. Burke and S. Xu, “A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem,” Math. Programming, vol. 87, pp. 113–130, 2000.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献