A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
type: Item
instance of: scholarly article
title: A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
zbMATH Open document ID: 1311.65066
author: Saman Babaie-Kafaki
author: Reza Ghanbari
published in: Numerical Algorithms
publication date: 2015-03-23T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6418186
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: large-scale optimization
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: global convergence
zbMATH Keywords: numerical example
zbMATH Keywords: Polak-Ribière-Polyak method
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s11075-014-9856-6
OpenAlex ID: W2003894104
Wikidata QID: Q57952646
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Hybrid conjugate gradient algorithm for unconstrained optimization
cites work: A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
cites work: An eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
cites work: A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
cites work: Two new conjugate gradient methods based on modified secant equations
cites work: TWO MODIFIED HYBRID CONJUGATE GRADIENT METHODS BASED ON A HYBRID SECANT EQUATION
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
cites work: Benchmarking optimization software with performance profiles.
cites work: Function minimization by conjugate gradients
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: CUTEr and SifDec
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Q5479892
cites work: Global convergence result for conjugate gradient methods
cites work: Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Restart procedures for the conjugate gradient method
cites work: Q3313210
cites work: Efficient hybrid conjugate gradient techniques
cites work: Convergence Conditions for Ascent Methods
cites work: Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
cites work: Q4103338
DBLP publication ID: journals/na/Babaie-KafakiG15
DOI: 10.1007/S11075-014-9856-6
description: scientific article; zbMATH DE number 6418186