A generalized conjugate gradient algorithm

DOI10.1023/A:1022653904717zbMath0908.90242OpenAlexW1596852224MaRDI QIDQ1265069

Enriqueta Vercher, S. San Matías

Publication date: 28 February 1999

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

Full work available at URL: https://doi.org/10.1023/a:1022653904717

zbMATH Keywords

unconstrained optimizationnonlinear programmingconjugate gradient methodsinexact line searches

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Convergence of line search methods for unconstrained optimization ⋮ Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems ⋮ Unnamed Item ⋮ Nonconvex optimization using negative curvature within a modified linesearch ⋮ Combining and scaling descent and negative curvature directions ⋮ Improving directions of negative curvature in an efficient manner

Uses Software

• minpack

Cites Work

• Unnamed Item
• Efficient generalized conjugate gradient algorithms. I: Theory
• Efficient hybrid conjugate gradient techniques
• Test examples for nonlinear programming codes
• Generalized Polak-Ribière algorithm
• Variational quasi-Newton methods for unconstrained optimization
• Preconditioned low-order Newton methods
• Efficient generalized conjugate gradient algorithms. II: Implementation
• Memory gradient method for the minimization of functions
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Testing Unconstrained Optimization Software
• On Steepest Descent