A New Family of Hybrid Conjugate Gradient Methods for Unconstrained Optimization
| dc.contributor.author | Adeleke, Olawale | |
| dc.date.accessioned | 2022-03-21T08:43:34Z | |
| dc.date.available | 2022-03-21T08:43:34Z | |
| dc.date.issued | 2021-06 | |
| dc.description.abstract | The conjugate gradient method is a very efficient iterative technique for solving large-scale unconstrained optimization problems. Motivated by recent modifications of some variants of the method and construction of hybrid methods, this study proposed four hybrid methods that are globally convergent as well as computationally efficient. The approach adopted for constructing the hybrid methods entails projecting ten recently modified conjugate gradient methods. Each of the hybrid methods is shown to satisfy the descent property independent of any line search technique and globally convergent under the influence of strong Wolfe line search. Results obtained from numerical implementation of these methods and performance profiling show that the methods are very competitive with well-known traditional methods. | en_US |
| dc.identifier.issn | 10.19139/soic.v7i3.480 | |
| dc.identifier.uri | http://dspace.run.edu.ng:8080/jspui/handle/123456789/2081 | |
| dc.language.iso | en | en_US |
| dc.subject | Hybrid methods | en_US |
| dc.subject | Nonlinear conjugate gradient method | en_US |
| dc.subject | Unconstrained optimization problems | en_US |
| dc.subject | Descent property | en_US |
| dc.subject | Global convergence | en_US |
| dc.subject | Strong Wolfe line search conditions | en_US |
| dc.title | A New Family of Hybrid Conjugate Gradient Methods for Unconstrained Optimization | en_US |
| dc.type | Article | en_US |