Hybrid conjugate gradient algorithm for unconstrained optimization
type: Item
instance of: scholarly article
title: Hybrid conjugate gradient algorithm for unconstrained optimization
zbMATH Open document ID: 1168.90017
published in: Journal of Optimization Theory and Applications
publication date: 2009-07-06T00:00:00Z
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5575996
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: hybrid conjugate gradient method
zbMATH Keywords: conjugacy condition
zbMATH Keywords: numerical comparisons
author: Neculai Andrei
describes a project that uses: Algorithm 500
describes a project that uses: CUTE
describes a project that uses: CUTEr
describes a project that uses: SCALCG
MaRDI profile type: Publication
full work available at URL: s10957-008-9505-0
OpenAlex ID: W2130092997
cites work: Q5479892
cites work: Function minimization by conjugate gradients
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q4226179
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Methods of conjugate gradients for solving linear systems
cites work: Global convergence result for conjugate gradient methods
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: An efficient hybrid conjugate gradient method for unconstrained optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: CUTE
cites work: Q3539529
cites work: Restart procedures for the conjugate gradient method
cites work: New properties of a nonlinear conjugate gradient method
cites work: On restart procedures for the conjugate gradient method
cites work: Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
cites work: A spectral conjugate gradient method for unconstrained optimization
cites work: Scaled conjugate gradient algorithms for unconstrained optimization
cites work: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: Convergence of the steepest descent method for minimizing quasiconvex functions
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
DOI: 10.1007/S10957-008-9505-0
description: scientific article; zbMATH DE number 5575996