A sparse counterpart of Reichel and Gragg's package QRUP
From MaRDI portal
(Redirected from Publication:1044853)
Recommendations
Cites work
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- A direct method for sparse least squares problems with lower and upper bounds
- A numerically stable form of the simplex algorithm
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Active set algorithms for isotonic regression; a unifying framework
- Algorithm 686: FORTRAN subroutines for updating the QR decomposition
- scientific article; zbMATH DE number 3784219 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Newton's Method for Large Bound-Constrained Optimization Problems
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Use of Structural Zeros in Orthogonal Factorization
- Row Modifications of a Sparse Cholesky Factorization
- Sparse Matrices in MATLAB: Design and Implementation
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(3)
This page was built for publication: A sparse counterpart of Reichel and Gragg's package QRUP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044853)