A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
type: Item
instance of: scholarly article
title: A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
zbMATH Open document ID: 1256.90050
author: Saman Babaie-Kafaki
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6135495
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: large-scale optimization
zbMATH Keywords: conjugate gradient algorithm
zbMATH Keywords: line search
zbMATH Keywords: global convergence
describes a project that uses: CUTEr
describes a project that uses: Algorithm 500
MaRDI profile type: Publication
full work available at URL: s10957-012-0016-7
OpenAlex ID: W2046088295
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q5479892
cites work: Function minimization by conjugate gradients
cites work: Q4226179
cites work: Methods of conjugate gradients for solving linear systems
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: A note on global convergence result for conjugate gradient methods
cites work: New properties of a nonlinear conjugate gradient method
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Global convergence result for conjugate gradient methods
cites work: Q4461063
cites work: Restart procedures for the conjugate gradient method
cites work: An efficient hybrid conjugate gradient method for unconstrained optimization
cites work: Another hybrid conjugate gradient algorithm for unconstrained optimization
cites work: Hybrid conjugate gradient algorithm for unconstrained optimization
cites work: Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
cites work: Q5491447
cites work: Optimization theory and methods. Nonlinear programming
cites work: New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
cites work: Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
cites work: A Modified BFGS Algorithm for Unconstrained Optimization
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
cites work: Convergence Conditions for Ascent Methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: Two new conjugate gradient methods based on modified secant equations
cites work: Q4103338
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
cites work: Convergence properties of the Fletcher-Reeves method
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
cites work: Conjugate gradient methods with Armijo-type line searches.
cites work: CUTEr and SifDec
cites work: Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.1007/S10957-012-0016-7
description: scientific article; zbMATH DE number 6135495