Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference32 articles.
1. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373–395 (1984)
2. Roos, C., Terlaky, T., Vial, J-Ph: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, Chichester (1997)
3. Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)
4. Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)
5. Roos, C., Vial, J-Ph: A polynomial method of approximate centers for linear programming. Math. Program. 54(1–3), 295–305 (1992)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献