Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization

DOI10.1080/00207169308804192zbMath0816.65036OpenAlexW2007387496MaRDI QIDQ4323721

No author found.

Publication date: 19 July 1995

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169308804192

zbMATH Keywords

numerical resultsnonlinear optimizationunconstrained minimizationNewton methodline searchNewton directionconjugate gradient type methodrestarting strategiesPolak-Ribière algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Uses Software

• NAG
• L-BFGS

Cites Work

• Unnamed Item
• Unnamed Item
• A new three-term conjugate gradient method
• On the limited memory BFGS method for large scale optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• Efficient hybrid conjugate gradient techniques
• A conjugate direction algorithm without line searches
• Global convergence result for conjugate gradient methods
• Generalized Polak-Ribière algorithm
• Efficient generalized conjugate gradient algorithms. II: Implementation
• QN-like variable storage conjugate gradients
• Algorithm 630
• Globally convergent conjugate gradient algorithms
• Restart procedures for the conjugate gradient method
• Conjugate Gradient Methods with Inexact Searches

This page was built for publication: Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization