1. I. Adler, F. Alizadeh, Primal–dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems, Technical Report RRR-111-95, Rutger Center for Operations Research, Brunswick, NJ, 1995
2. Implementation of interior point methods for large scale linear programming;Andersen,1996
3. On implementing a primal–dual interior-point method for conic quadratic optimization;Andersen;Mathematical Programming (Series B),2003
4. A comparative study of kernel functions for primal–dual interior-point algorithms in linear optimization;Bai;SIAM Journal on Optimization,2004
5. Y.Q. Bai, J. Guo, C. Roos, A new kernel function yielding the best known iteration bounds for primal–dual interior-point algorithms, Acta Mathematica Sinica, English Series, July 2006 (submitted for publication)