A direct method for sparse least squares problems with lower and upper bounds
From MaRDI portal
Publication:1112557
DOI10.1007/BF01403888zbMath0659.65039OpenAlexW17198020MaRDI QIDQ1112557
Publication date: 1988
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133301
numerical testssparse matricesleast squares problemQR-factorizationfill-in comparison of methodsM.R. 51.2270stable updating
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (13)
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ Algorithms for bound constrained quadratic programming problems ⋮ Regularization of a Volterra integral equation by linear inequalities ⋮ An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables ⋮ A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule ⋮ A survey of direct methods for sparse linear systems ⋮ A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables ⋮ A direct active set algorithm for large sparse quadratic programs with simple bounds ⋮ An efficient Hessian based algorithm for singly linearly and box constrained least squares regression ⋮ On iterative algorithms for linear least squares problems with bound constraints ⋮ A sparse counterpart of Reichel and Gragg's package QRUP ⋮ The adventures of a simple algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the minimal least squares problem subject to bounds on the variables
- Rank and null space calculations using matrix decomposition without column interchanges
- A direct method for sparse least squares problems with lower and upper bounds
- Solution of sparse linear least squares problems using Givens rotations
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Stability analysis of the method of seminormal equations for linear least squares problems
- On Row and Column Orderings for Sparse Least Squares Problems
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Predicting fill for sparse orthogonal factorization
- An algorithm for linear least squares problems with equality and nonnegativity constraints
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Perturbation Bounds for the $QR$ Factorization of a Matrix
- Methods for Modifying Matrix Factorizations
- Sparse Matrix Methods in Optimization
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- On the Numerical Solution of Constrained Least-Squares Problems
This page was built for publication: A direct method for sparse least squares problems with lower and upper bounds
