Global convergence of a nonlinear conjugate gradient method
type: Item
instance of: scholarly article
title: Global convergence of a nonlinear conjugate gradient method
zbMATH Open document ID: 1235.90181
DOI: 10.1155/2011/463087
author: Jinkui Liu
author: Limin Zou
author: Xiao-Qian Song
published in: Mathematical Problems in Engineering
publication date: 2012-04-03T00:00:00Z
review text: Summary: A modified PRP nonlinear conjugate gradient method to solve unconstrained optimization problems is proposed. The important property of the proposed method is that the sufficient descent property is guaranteed independent of any line search. By the use of the Wolfe line search, the global convergence of the proposed method is established for nonconvex minimization. Numerical results show that the proposed method is effective and promising by comparing with the VPRP, CG-DESCENT, and DL\(^{+}\) methods.
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65J15
zbMATH DE Number: 6021095
Wikidata QID: Q58693086
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2011/463087
OpenAlex ID: W2047274706
cites work: Q5563083
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: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: Q5479892
cites work: Q3313210
cites work: Convergence Properties of Algorithms for Nonlinear Optimization
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
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 globally convergent version of the Polak-Ribière conjugate gradient method
cites work: A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
cites work: Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
cites work: Notes on the Dai-Yuan-Yuan modified spectral gradient method
cites work: New spectral PRP conjugate gradient method for unconstrained optimization
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: Q4103338
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking optimization software with performance profiles.
description: scientific article; zbMATH DE number 6021095