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.)
Advanced preprocessing techniques for linear and quadratic programming. (Working paper of the Laboratory of Operations Research and Decision Systems (LORDS) WP 2002-6)
On the Cholesky factorization in interior point methods. (Working paper of the Laboratory of Operations Research and Decision Systems (LORDS) WP 2002-5)