Steplengths in infeasible primal-dual interior point algorithms of convex quadratic programming.(Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/7.)
On free variables in interior point methods. (Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/4.)
A respository of convex quadratic programming problems. (Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/6.)
On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors. (Working paper of the Laboratory of Operations Research and Decision Systems. (LORDS) WP04-9)