Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property

DOI10.3934/jimo.2008.4.565zbMath1168.65030OpenAlexW2316087566MaRDI QIDQ1018910

Guoyin Li, Lutai Guan, Gaohang Yu

Publication date: 26 May 2009

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2008.4.565

zbMATH Keywords

algorithmsunconstrained optimizationglobal convergencenumerical examplesconjugate gradient methodnonconvex minimizationPolak-Ribière-Polyak implementation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (19)

A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization ⋮ A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization ⋮ A hybrid of DL and WYL nonlinear conjugate gradient methods ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem ⋮ A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization ⋮ Two modified DY conjugate gradient methods for unconstrained optimization problems ⋮ A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method ⋮ A hybrid conjugate gradient method with descent property for unconstrained optimization ⋮ Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property ⋮ A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS

This page was built for publication: Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property