Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference32 articles.
1. Ai, W., Zhang, S.: An $$O(\sqrt{n}L)$$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16(2), 400–417 (2005). (electronic)
2. Amini, K., Peyghami, M.: Exploring complexity of large update interior-point methods for $$P_*(\kappa )$$ linear complementarity problem based on kernel function. Appl. Math. Comput. 207(2), 501–513 (2009)
3. Anitescu, M., Lesaja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Methods Softw. 7(3), 265–290 (1997)
4. Anstreicher, K.M.: Interior-point algorithms for a generalization of linear programming and weighted centring. Optim. Methods Softw. 27(4–5), 605–612 (2012)
5. Atkinson, D.S., Vaidya, P.M.: A scaling technique for finding the weighted analytic center of a polytope. Math. Progr. 57(2), 163–192 (1992)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献