Another nonlinear conjugate gradient algorithm for unconstrained optimization

DOI10.1080/10556780802393326zbMath1154.90586OpenAlexW2045319544MaRDI QIDQ3603657

Neculai Andrei

Publication date: 18 February 2009

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained optimizationconjugate gradient methodconjugacy conditionnumerical comparisonssufficient descent condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (5)

Unnamed Item ⋮ Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization ⋮ A method of two new augmented Lagrange multiplier versions for solving constrained problems ⋮ Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions ⋮ Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization

Uses Software

• Algorithm 500
• SCALCG

This page was built for publication: Another nonlinear conjugate gradient algorithm for unconstrained optimization