A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems

A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems

In this paper, a modification to the Polak–Ribiére–Polyak (PRP) nonlinear conjugate gradient method is presented. The proposed method always generates a sufficient descent direction independent of the accuracy of the line search and the convexity of the objective funct...

Full description

Bibliographic Details
Main Authors: Xiuyun Zheng, Jiarong Shi
Format: Article
Language:English
Published: MDPI AG 2018-09-01
Series:Algorithms
Subjects:
unconstrained optimization
conjugate gradient method
sufficient descent
global convergence
Online Access:http://www.mdpi.com/1999-4893/11/9/133

Similar Items

Similar Items