Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference31 articles.
1. Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25(1), 97–110 (2006)
2. Achache, M., Boudiaf, N.: Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem. J. Numer. Anal. Approx. Theory 40(2), 95–106 (2011)
3. Ahmadi, K., Hasani, F., Kheirfam, B.: A full-Newton step infeasible interior-point algorithm based on Darvay directions for linear optimization. J. Math. Model. Algorithms Oper. Res. 13(2), 191–208 (2014)
4. Asadi, S., Mansouri, H.: A full-Newton step infeasible-interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) -horizontal linear complementarity problems. Yugoslav J. Oper. Res. 25, 57–72 (2015)
5. Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) horizontal linear complementarity problems. Numer. Algorithms 63, 385–398 (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献