A monotonicity result for norms in conjugate gradient algorithms
From MaRDI portal
Publication:2679560
Recommendations
Cites work
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space
- An increasing‐angle property of the conjugate gradient method and the implementation of large‐scale minimization algorithms with line searches
- scientific article; zbMATH DE number 42636 (Why is no real title available?)
- scientific article; zbMATH DE number 3537182 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 783550 (Why is no real title available?)
- Iterative Krylov Methods for Large Linear Systems
- Krylov subspace methods. Principles and analysis.
- Methods of conjugate gradients for solving linear systems
- Numerical Optimization
- ON THE RATE OF CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR LINEAR OPERATORS IN HILBERT SPACE
- On the real convergence rate of the conjugate gradient method
- Parallel Multilevel Preconditioners
- Preconditioning and the conjugate gradient method in the context of solving PDEs
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Trust Region Methods
This page was built for publication: A monotonicity result for norms in conjugate gradient algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679560)