1. C. Cartis, On interior point methods for linear programming, PhD thesis, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, 2004
2. C. Cartis, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Technical Report 04/27, Numerical Analysis Group, Oxford University Computing Laboratory, 2004. Available at http://www.optimization-online.org/DB_HTML/2005/02/1062.html
3. Interior point methods: current status and future directions;Freund,2000
4. Multiple centrality corrections in a primal-dual method for linear programming;Gondzio;Comput. Optim. Appl.,1996
5. Path-following methods for linear programming;Gonzaga;SIAM Rev.,1992