An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
type: Item
instance of: scholarly article
title: An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
zbMATH Open document ID: 1402.90176
author: Deren Han
author: Lixiang Li
author: Jianguang Zhu
author: Xiaoliang Dong
author: Zhifeng Dai
published in: Journal of Optimization Theory and Applications
publication date: 2018-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6985501
zbMATH Keywords: three-term conjugate gradient method
zbMATH Keywords: sufficient descent condition
zbMATH Keywords: conjugacy condition
zbMATH Keywords: global convergence
zbMATH Keywords: condition number
describes a project that uses: CUTE
describes a project that uses: ACGSSV
describes a project that uses: CUTEr
describes a project that uses: SCALCG
MaRDI profile type: Publication
full work available at URL: s10957-018-1377-3
OpenAlex ID: W2889379562
cites work: Function minimization by conjugate gradients
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Methods of conjugate gradients for solving linear systems
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q5479892
cites work: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
cites work: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
cites work: Some descent three-term conjugate gradient methods and their global convergence
cites work: A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
cites work: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
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: An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
cites work: Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
cites work: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
cites work: Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
cites work: The global convergence of a modified BFGS method for nonconvex functions
cites work: A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
cites work: A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
cites work: Spectral gradient method for impulse noise removal
cites work: A decomposition method for large-scale box constrained optimization
cites work: An accurate active set Newton algorithm for large scale bound constrained optimization.
cites work: An active set strategy based on the multiplier function or the gradient.
cites work: Parallel SSLE algorithm for large scale constrained optimization
cites work: Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
cites work: Technical Note—A Modified Conjugate Gradient Algorithm
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: A nonlinear conjugate gradient method based on the MBFGS secant condition
cites work: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
cites work: Multi-step nonlinear conjugate gradient methods for unconstrained minimization
cites work: New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
cites work: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
cites work: On three-term conjugate gradient algorithms for unconstrained optimization
cites work: A simple three-term conjugate gradient algorithm for unconstrained optimization
cites work: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
cites work: Exploiting damped techniques for nonlinear conjugate gradient methods
cites work: A descent family of Dai–Liao conjugate gradient methods
cites work: The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
cites work: A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
cites work: On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
cites work: A new efficient conjugate gradient method for unconstrained optimization
cites work: A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
cites work: A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
cites work: Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
cites work: New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
cites work: Two modified three-term conjugate gradient methods with sufficient descent property
cites work: The Limited Memory Conjugate Gradient Method
cites work: A modified two-point stepsize gradient algorithm for unconstrained minimization
cites work: Convergence Conditions for Ascent Methods
cites work: CUTE

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (cites work)
cites work: Benchmarking optimization software with performance profiles.

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (DOI)
DOI: 10.1007/S10957-018-1377-3