Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference39 articles.
1. K.M. Anstreicher and R.A. Bosch, “Long steps in an O(n 3 L) algorithm for linear programming,”Mathematical Programming 54 (1992) 251–265.
2. K.M. Anstreicher, D. den Hertog, C. Roos and T. Terlaky, “A long step barrier method for convex quadratic programming,” Technical Report, Faculty of Technical Mathematics and Computer Science, Delft University of Technology (Delft, The Netherlands, 1990).
3. E.R. Barnes, “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.
4. I.I. Dikin, “Iterative solution of problems of linear and quadratic programming,”Soviet Mathematics Doklady 8 (1967) 674–675.
5. R.M. Freund, “Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,”Mathematical Programming 51 (1991) 203–222.
Cited by
128 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献