A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
type: Item
instance of: scholarly article
title: A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
zbMATH Open document ID: 1394.90559
DOI: 10.1155/2015/352524
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: A new nonlinear conjugate gradient formula, which satisfies the sufficient descent condition, for solving unconstrained optimization problem is proposed. The global convergence of the algorithm is established under weak Wolfe line search. Some numerical experiments show that this new WWPNPRP algorithm is competitive to the SWPPRP algorithm, the SWPHS algorithm, and the WWPDYHS algorithm.
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6926125
Wikidata QID: Q59118126
author: Xiao Ping Wu
author: Liying Liu
author: Feng Jie Xie
author: Yongfei Li
describes a project that uses: CUTEr
describes a project that uses: minpack
describes a project that uses: CUTE
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/352524
OpenAlex ID: W2120572659
cites work: Q4103338
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: An efficient hybrid conjugate gradient method for 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: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: A note about WYL's conjugate gradient method and its applications
cites work: A new globally convergent conjugate gradient method with Wolfe line search
cites work: Q4900512
cites work: Efficient hybrid conjugate gradient techniques
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Global convergence result for conjugate gradient methods
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
cites work: Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
cites work: A hybrid conjugate gradient method with descent property for unconstrained optimization
cites work: New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
cites work: The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
cites work: A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
cites work: Convergence Conditions for Ascent Methods
cites work: Convergence Conditions for Ascent Methods. II: Some Corrections
cites work: CUTE
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking optimization software with performance profiles.
description: scientific article; zbMATH DE number 6926125