Baryamureeba, VenansiusSteihaug, TrondZhang, Yin2022-07-172022-07-171999Baryamureeba, V., & Steihaug, T. (1999, August). Application of a class of preconditioners to large scale linear programming problems. In European Conference on Parallel Processing (pp. 1044-1048). Springer, Berlin, Heidelberg.https://link.springer.com/chapter/10.1007/3-540-48311-X_146https://nru.uncst.go.ug/handle/123456789/4210In most interior point methods for linear programming, a sequence of weighted linear least squares problems are solved, where the only changes from one iteration to the next are the weights and the right hand side. The weighted least squares problems are usually solved as weighted normal equations by the direct method of Cholesky factorization. In this paper, we consider solving the weighted normal equations by a preconditioned conjugate gradient method at every other iteration. We use a class of preconditioners based on a low rank correction to a Cholesky factorization obtained from the previous iteration. Numerical results show that when properly implemented, the approach of combining direct and iterative methods is promisingenWeighted linear least squaresParallel processingPreconditionersLinear programmingPrimal-dual infeasible interior point algorithmsBook chapter