A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
type: Item
instance of: scholarly article
title: A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
zbMATH Open document ID: 1433.90160
author: Parvaneh Faramarzi
author: Keyvan Amini
published in: Calcolo
publication date: 2019-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7138874
zbMATH Keywords: scaling parameter
zbMATH Keywords: three-term conjugate gradient method
zbMATH Keywords: moving asymptotes
zbMATH Keywords: sufficient descent property
zbMATH Keywords: Armijo-type line search
describes a project that uses: CUTE
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s10092-019-0333-4
OpenAlex ID: W2974670071
cites work: A modified Hestenes–Stiefel conjugate gradient method with an optimal property
cites work: Q3539529
cites work: CUTE
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Benchmarking optimization software with performance profiles.
cites work: A modified spectral conjugate gradient method with global convergence
cites work: Function minimization by conjugate gradients
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Methods of conjugate gradients for solving linear systems
cites work: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
cites work: A globally convergent method of moving asymptotes with trust region technique
cites work: Numerical Optimization
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: On the Convergence of a New Conjugate Gradient Algorithm
cites work: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
cites work: The method of moving asymptotes—a new method for structural optimization
cites work: A new method of moving asymptotes for large-scale unconstrained optimization
cites work: Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
cites work: Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Some descent three-term conjugate gradient methods and their global convergence
cites work: A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems
cites work: Global convergence of a nonlinear programming method using convex approximations
Wikidata QID: Q127228703
DOI: 10.1007/S10092-019-0333-4
description: scientific article; zbMATH DE number 7138874