1. N.K. Karmarkar, A new polynomial-time algorithm for linear programming, in: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 302–311.
2. Interior Point Approach to Linear, Quadratic and Convex Programming;den Hertog,1994
3. Self-Regularity: A New Paradigm for Primal–Dual Interior-Point Algorithms;Peng,2002
4. Theory and Algorithms for Linear Optimization. An Interior-Point Approach;Roos,1997
5. Interior Point Algorithms, Theory and Analysis;Ye,1997