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.)
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
On a property of the Cholesky factorization and its consequences for interior point methods. ( Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-7.)
The separable and non-separable formulations of convex quadratic problems in interior point methods. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-3.)
The BPMPD interior point solver for convex quadratic problems. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-8.)
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.)