A monotonicity result for norms in conjugate gradient algorithms
From MaRDI portal
Publication:2679560
DOI10.1007/s10957-022-02134-8OpenAlexW4309198773MaRDI QIDQ2679560
Publication date: 23 January 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02134-8
Large-scale problems in mathematical programming (90C06) Programming in abstract spaces (90C48) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the real convergence rate of the conjugate gradient method
- A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- ON THE RATE OF CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR LINEAR OPERATORS IN HILBERT SPACE
- Parallel Multilevel Preconditioners
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Numerical Optimization
- Trust Region Methods
- Iterative Krylov Methods for Large Linear Systems
- Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs
- An increasing‐angle property of the conjugate gradient method and the implementation of large‐scale minimization algorithms with line searches
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A monotonicity result for norms in conjugate gradient algorithms