Efficient generalized conjugate gradient algorithms. II: Implementation

DOI10.1007/BF00940465zbMath0724.90068MaRDI QIDQ2277157

Yanyan Li

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationinexact line searchcomparison of algorithmslimited memory quasi-Newton methodshybrid and restart conjugate gradient methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines ⋮ Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization ⋮ Efficient generalized conjugate gradient algorithms. I: Theory ⋮ A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization ⋮ A generalized conjugate gradient algorithm ⋮ Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory ⋮ Generalized Polak-Ribière algorithm ⋮ Preconditioned low-order Newton methods

Cites Work

• A new three-term conjugate gradient method
• Conjugate Gradient Methods less Dependent on Conjugacy
• The method of successive affine reduction for nonlinear minimization
• Restart procedures for the conjugate gradient method
• Rate of Convergence of Several Conjugate Gradient Algorithms

This page was built for publication: Efficient generalized conjugate gradient algorithms. II: Implementation