Conjugate gradients for symmetric positive semidefinite least-squares problems
From MaRDI portal
Publication:5028579
DOI10.1080/00207160.2017.1371701zbMath1499.65114OpenAlexW2751474608MaRDI QIDQ5028579
Publication date: 10 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2017.1371701
Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Preconditioned conjugate gradients for solving singular systems
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Solution of Sparse Indefinite Systems of Linear Equations
- Iterative Solution Methods
- Algorithm 937
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Conjugate gradients for symmetric positive semidefinite least-squares problems
