A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
Open Access
- 1 October 1994
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 63 (208), 625-643
- https://doi.org/10.2307/2153286
Abstract
In this paper we discuss the use of block principal pivoting and predictor-corrector methods for the solution of large-scale linear least squares problems with nonnegative variables (NVLSQ). We also describe two implementations of these algorithms that are based on the normal equations and corrected seminormal equations (CSNE) approaches. We show that the method of normal equations should be employed in the implementation of the predictor-corrector algorithm. This type of approach should also be used in the implementation of the block principal pivoting method, but a switch to the CSNE method may be useful in the last iterations of the algorithm. Computational experience is also included in this paper and shows that both the predictor-corrector and the block principal pivoting algorithms are quite efficient to deal with large-scale NVLSQ problems.Keywords
This publication has 9 references indexed in Scilit:
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- On iterative algorithms for linear least squares problems with bound constraintsLinear Algebra and its Applications, 1991
- A direct method for sparse least squares problems with lower and upper boundsNumerische Mathematik, 1988
- Bard-type Methods for the Linear Complementarity problem with symmetric positive Definite MatricesIMA Journal of Management Mathematics, 1988
- Computer Solution of Large Sparse Positive Definite Systems.Mathematics of Computation, 1982
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- Block pivot methods for solving the complementarity problemLinear Algebra and its Applications, 1978
- Solving Least Squares ProblemsMathematics of Computation, 1976