1. I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, “An implementation of Karmarkar's algorithm for linear programming,”Mathematical Programming 44 (1989) 297–335.
2. K.M. Anstreicher and R.A. Bosch, “Long steps in a O(n 3 L) algorithm for linear programming,” Technical Report, Yale School of Management (New Haven, CT, 1989).
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,” OR 182-88, Sloan School of Management, Massachusetts Institute of Technology (Cambridge, MA, 1988).