An efficient implementation of the primal-dual interior-point method for linear and convex quadratic programming. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-12.)
On the sparsity issues of interior point methods for quadratic programming. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-4.)