A modified Schur-complement method for handling dense columns in interior-point methods for linear programming

Authors:
Knud D. Andersen
Affiliations:
Univ. Catholique de Louvain, Louvain-la-Neuve, Belgium
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1996

Citing 3
Cited 1

On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method

Mathematical Programming: Series A and B
Presolving in linear programming

Mathematical Programming: Series A and B
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)

Efficient svm training using low-rank kernel representations

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main computational work in interior-point methods for linear programming (LP) is to solve a least-squares problem. The normal equations are often used, but if the LP constraint matrix contains a nearly dense column the normal-equations matrix will be nearly dense. Assuming that the nondense part of the constraint matrix is of full rank, the Schur complement can be used to handle dense columns. In this article we propose a modified Schur-complement method that relaxes this assumption. Encouraging numerical results are presented.