A new three-term conjugate gradient method
DOI10.1007/BF00941495zbMATH Open0556.90077OpenAlexW2090988481MaRDI QIDQ761255FDOQ761255
Authors: D. Kharzeev 
Publication date: 1985
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00941495
Recommendations
- A new three-term conjugate gradient algorithm for unconstrained optimization
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A new three-term conjugate gradient method with descent direction for unconstrained optimization
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
unconstrained optimizationconjugate gradient algorithmpreconditioning matricesNazareth three- term formularestart tests
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Function minimization by conjugate gradients
- A conjugate direction algorithm without line searches
- Restart procedures for the conjugate gradient method
- Title not available (Why is that?)
- Convergence Conditions for Ascent Methods
- Methods of conjugate gradients for solving linear systems
- Minimization of functions having Lipschitz continuous first partial derivatives
- QN-like variable storage conjugate gradients
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Conjugate Directions without Linear Searches
- Title not available (Why is that?)
Cited In (14)
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Title not available (Why is that?)
- Some three-term conjugate gradient methods with the inexact line search condition
- A review of parallel finite element methods on the DAP
- Iterative computation of negative curvature directions in large scale optimization
- Generalized Polak-Ribière algorithm
- Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- A three-parameter family of nonlinear conjugate gradient methods
- Conjugate gradient methods using quasi-Newton updates with inexact line searches
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- Numerical experience with the truncated Newton method for unconstrained optimization
This page was built for publication: A new three-term conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761255)
