1. A new primal-dual path-following method for convex quadratic programming;Achache;Comput. Appl. Math.,2006
2. Interior path-following primal-dual algorithm. Part II: convex quadratic programming;Adler;Math. Program.,1989
3. Interior point methods in semidefinite programming with applications to combinatorial optimization;Alizadeh;SIAM J. Optim.,1995
4. E. De Klerk, Interior point methods for semidefinite programming, Master of Science in the Faculty of Engineering, University of Pretoria, 1997.
5. E. De Klerk, C. Roos, T. Terlaky, On primal-dual path following algorithms for semidefinite programming, Reports of the faculty of technical mathematics and informatica Nr 96-102, Delft University, 1996.