New step lengths in conjugate gradient methods
From MaRDI portal
Publication:611340
DOI10.1016/j.camwa.2010.05.003zbMath1201.65079MaRDI QIDQ611340
Publication date: 14 December 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.05.003
65K10: Numerical optimization and variational techniques
65H10: Numerical computation of solutions to systems of equations
Related Items
A practical PR+ conjugate gradient method only using gradient, A globally convergent hybrid conjugate gradient method and its numerical behaviors, A variable metric proximal-descent algorithm for monotone operators
Cites Work
- Unnamed Item
- Unnamed Item
- Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities
- Efficient generalized conjugate gradient algorithms. I: Theory
- Convergence of PRP method with new nonmonotone line search
- A note on convergence of PRP method with new nonmonotone line search
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Combined relaxation methods for finding equilibrium points and solving related problems
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Numerical Optimization
- Line search algorithms with guaranteed sufficient decrease
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
