George, J. A., Liu, J. W., and Ng, E. (2001). “Computer Solution of Positive Definite Systems.” Unpublished manuscript available from authors.
Lustig, I. J., Marsten, R. E., and Shanno, D. F. (1992). “On Implementing Mehrotra’s Predictor-Corrector Interior-Point Method for Linear Programming.” SIAM Journal on Optimization 2:435–449.
Murtagh, B. A. (1981). Advanced Linear Programming: Computation and Practice. New York: McGraw-Hill.
Reid, J. K. (1975). A Sparsity-Exploiting Variant of the Bartels-Golub Decomposition for Linear Programming Bases. Technical Report Harwell CSS 20, Atomic Energy Research Establishment, Harwell, UK.
Roos, C., Terlaky, T., and Vial, J. (1997). Theory and Algorithms for Linear Optimization. Chichester, UK: John Wiley & Sons.
Wright, S. J. (1997). Primal-Dual Interior-Point Methods. Philadelphia: SIAM.
Ye, Y. (1996). Interior Point Algorithms: Theory and Analysis. New York: John Wiley & Sons.