1. Andersen, E.D., Gondzio, J., Mészáros, C., Xu, X.: Implementation of interior point methods for large scale linear programming. In: Terlaky, T. (ed.) Interior Point Methods in Mathematical Programming, pp. 189–252. Kluwer Academic, Dordrecht (1996)
2. Carpenter, T.J., Lustig, I.J., Mulvey, J.M., Shanno, D.F.: Higher-order predictor-corrector interior point methods with application to quadratic objectives. SIAM J. Optim. 3, 696–725 (1993)
3. Cartis, C.: Some disadvantages of a Mehrotra-type primal–dual corrector interior-point algorithm for linear programming. Technical report 04/27, Numerical Analysis Group, Computing Laboratory, Oxford University (2004)
4. Cartis, C.: On the convergence of a primal–dual second-order corrector interior point algorithm for linear programming. Technical report 05/04, Numerical Analysis Group, Computing Laboratory, Oxford University (2005)
5. Czyzyk, J., Mehrotra, S., Wright, S.: PCx user guide. Technical report OTC 96/01, Optimization Technology Center (May 1996)