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

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 ...