The following pages link to HSL_MI28 (Q25290):
Displaying 14 items.
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations (Q2831075) (← links)
- On positive semidefinite modification schemes for incomplete Cholesky factorization (Q2874998) (← links)
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems (Q3133587) (← links)
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners (Q3174763) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners (Q4599015) (← links)
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems (Q5021403) (← links)
- Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices (Q5165449) (← links)
- On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems (Q5176059) (← links)
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems (Q5230611) (← links)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems (Q5350438) (← links)
