New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
type: Item
instance of: scholarly article
title: New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
zbMATH Open document ID: 1409.90193
author: Predrag S. Stanimirović
author: Branislav Ivanov
author: Ivona Brajević
author: Snežana S. Djordjević
published in: Journal of Optimization Theory and Applications
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7032762
zbMATH Keywords: global convergence
zbMATH Keywords: backtracking line search
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: conjugate gradient methods
zbMATH Keywords: quasi-Newton methods
MaRDI profile type: Publication
full work available at URL: s10957-018-1324-3
OpenAlex ID: W2808289429
cites work: Function minimization by conjugate gradients
cites work: Q4226179
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Methods of conjugate gradients for solving linear systems
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: A global convergence of LS-CD hybrid conjugate gradient method
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
cites work: An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
cites work: Accelerated gradient descent methods with line search
cites work: Efficient hybrid conjugate gradient techniques
cites work: Two descent hybrid conjugate gradient methods for optimization
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: An efficient hybrid conjugate gradient method for unconstrained optimization
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: The hybrid BFGS-CG method in solving unconstrained optimization problems
cites work: Q4103338
cites work: A Two-Term PRP-Based Descent Method
cites work: Q4461927
cites work: A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
cites work: Q3539529
cites work: Benchmarking optimization software with performance profiles.
Wikidata QID: Q129702857
DOI: 10.1007/S10957-018-1324-3
description: scientific article; zbMATH DE number 7032762