A modified quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient method for unconstrained optimization problems
This article presents a modified quadratic hybridization of the Polak–Ribiere–Polyak and Fletcher–Reeves conjugate gradient method for solving unconstrained optimization problems. Global convergence, with the strong Wolfe line search conditions, of the proposed quadratic hybrid conjugate gradient me...
Main Authors: | Pro Kaelo, Sindhu Narayanan, M.V. Thuto |
---|---|
Format: | Article |
Language: | English |
Published: |
Balikesir University
2017-07-01
|
Series: | An International Journal of Optimization and Control: Theories & Applications |
Subjects: | |
Online Access: | http://ijocta.balikesir.edu.tr/index.php/files/article/view/339 |
Similar Items
-
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
by: Shashi Kant Mishra, et al.
Published: (2021-01-01) -
A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems
by: Xiuyun Zheng, et al.
Published: (2018-09-01) -
On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method
by: Min Sun, et al.
Published: (2014-01-01) -
Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Algorithm for Large-Scale Box-Constrained Optimization
by: Qiuyu Wang, et al.
Published: (2014-01-01) -
Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems
by: Zhifeng Dai
Published: (2014-01-01)