Globally convergent conjugate gradient algorithms

DOI10.1007/BF01582011zbMath0579.90079MaRDI QIDQ3703663

David F. Shanno

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

convergenceunconstrained minimizationconjugate gradient algorithmssteepest descent search direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (10)

Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ⋮ Global convergence of the Fletcher-Reeves algorithm with inexact linesearch ⋮ Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method ⋮ A globally convergent version of the Polak-Ribière conjugate gradient method ⋮ Efficient hybrid conjugate gradient techniques ⋮ Two diagonal conjugate gradient like methods for unconstrained optimization ⋮ Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization ⋮ Efficient generalized conjugate gradient algorithms. I: Theory ⋮ An algorithm for solving sparse nonlinear least squares problems ⋮ Unnamed Item

Uses Software

• Algorithm 500

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing Unconstrained Optimization Software
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches
• On the Convergence of a New Conjugate Gradient Algorithm
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Globally convergent conjugate gradient algorithms