Some convergence properties of the conjugate gradient method
From MaRDI portal
Publication:4127902
DOI10.1007/BF01580369zbMATH Open0356.65056DBLPjournals/mp/Powell76OpenAlexW2085690530WikidataQ94871401 ScholiaQ94871401MaRDI QIDQ4127902FDOQ4127902
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580369
Cites Work
Cited In (23)
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- A Subspace Study on Conjugate Gradient Algorithms
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
- Nonlinear conjugate gradient methods for the optimal control of laser surface hardening
- A combined conjugate-gradient quasi-Newton minimization algorithm
- Extended conjugate-gradient methods with restarts
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- A new descent algorithm with curve search rule
- Restart procedures for the conjugate gradient method
- The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
- \(n\)-step quadratic convergence of a restart Liu-Storey type method
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- Rate of Convergence of a Restarted CG-DESCENT Method
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- Simultaneous nonlinear structural analysis and design
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
This page was built for publication: Some convergence properties of the conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127902)