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.)
Fast Cholesky factorization for interior point methods of linear programming.(Working paper of the Laboratory of Operations Research and Decision Systems (LORDS) WP 94-5.)
OPTIMIZATION AND ENGINEERING: INTERNATIONAL MULTIDISCIPLINARY JOURNAL TO PROMOTE OPTIMIZATION THEORY AND APPLICATIONS IN ENGINEERING SCIENCES, 14 (4)., pp. 519-527. ISSN 1389-4420
On sparse matrix orderings in interior point methods
Linear programming as a tool for solving multi-project scheduling limited resource problems. (Working paper of the Laboratory of Operations Research and Decision Systems (LORDS) WP 94-12.)
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.)