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

DOI10.1080/01630563.2016.1178142zbMATH Open1351.49039OpenAlexW2341408379MaRDI QIDQ2829590FDOQ2829590

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

global convergencespectral analysisunconstrained optimizationconjugate gradient methodgeneralized conjugacy condition

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Applying powell's symmetrical technique to conjugate gradient methods
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829590)