Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition

DOI10.1080/01630563.2016.1178142zbMath1351.49039OpenAlexW2341408379MaRDI QIDQ2829590

Yamina Laskri, Hamza Guebbai, Noureddine Benrabia, Mehiddin Al-Baali

Publication date: 8 November 2016

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodspectral analysisgeneralized conjugacy condition

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Technical Note—A Modified Conjugate Gradient Algorithm
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition