A direct method for sparse least squares problems with lower and upper bounds
- 1 January 1988
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 54 (1) , 19-32
- https://doi.org/10.1007/bf01403888
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Stability analysis of the method of seminormal equations for linear least squares problemsLinear Algebra and its Applications, 1987
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 1986
- Sparse Matrix Methods in OptimizationSIAM Journal on Scientific and Statistical Computing, 1984
- Numerical Methods for Large Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1984
- Some Extensions of an Algorithm for Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1982
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problemsLinear Algebra and its Applications, 1980
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- Perturbation Bounds for the $QR$ Factorization of a MatrixSIAM Journal on Numerical Analysis, 1977
- Methods for modifying matrix factorizationsMathematics of Computation, 1974
- On the Numerical Solution of Constrained Least-Squares ProblemsSIAM Journal on Numerical Analysis, 1971