1. Kojima, M., Mizuno, S. & Yoshise, A. (1989), A primal-dual interior point algorithm for linear programming, in N. Megiddo, ed., ‘Progress in Mathematical Programming’, Springer-Verlag, New York, pp. 29–47.
2. Lustig, I. (1990), ‘Feasibility issues in a primal-dual interior-point method for linear programming’, Mathematical Programming 49(2), 145–162.
3. Khachian, L. (1979), ‘A polynomial algorithm in linear programming’, Doklady Academiia Nauk SSSR 244, 191–194. In Russian. English Translation: Soviet Mathematics Doklady 20: 191-194.
4. Karmarkar, N. (1984), ‘A new polynomial time algorithm for linear programming’, Combinatorica 4, 373–395.
5. Monteiro, R. & Adler, I. (1989), ‘Interior path following primal-dual algorithms: Part i: Linear programming’, Mathematical Programming 44, 27–41.