1. D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming,” Preprints, AT&T Bell Laboratories (Murray Hills, NJ, 1986).
2. M.B. Daya and C.M. Shetty, “Polynomial barrier function algorithm for linear programming,” Technical report J 88-4, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1987).
3. M.B. Daya and C.M. Shetty, “Polynomial barrier function algorithm for convex quadratic programming,” Technical report J 88-5, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1988).
4. A.V. Fiacco and G.P. McCormick, “The sequential unconstrained minimization technique (SUMT) for nonlinear programming, a primal—dual method,”Management Science 10 (1964) 601–617.
5. R.M. Freund, “Projective transformations for interior point methods, Part I: Basic theory and linear programming,” Working paper OR 179-88, Massachusetts Institute of Technology (Boston, MA, 1988).