1. I. Adler, N. Karmarkar, M. G. C. Resende, and G. Veiga, An implementation of Karmarkar’s algorithm for linear programming, Working Paper, Operations Research Center, University of California, Berkeley (May 1986).
2. K. R. Frish, The logarithmic potential method of convex programming, unpublished manuscript, University Institute of Economics, Oslo, Norway (1955).
3. D. M. Gay, A variant of Karmarkar’s linear programming algorithm for problems in standard form, Math. Programming
37 (1987), 81–90.
4. P. E. Gill, W. Murray, M. A. Saunders, J. A. Tomlin, and M. H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, Math. Programming
36 (1986), 183–209.
5. C. C. Gonzaga, An algorithm for solving linear programming problems in O(n
3
L) operations, in Progress in Mathematical Programming, N. Megiddo, (ed.), Springer-Verlag, New York, this volume.