New Conjugacy Coefficient for Conjugate Gradient Method for Unconstrained Optimization
Section: Research Paper
Pages
33-46Keywords:
unconstrained Optimization,
conjugate gradient method,
inexact line search,
global convergence,
and strong wolf condition
Abstract
In this paper, we derived a new conjugacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical results indicate that the new approach yields very effective depending on number of iterations and number of functions evaluation .
References
Identifiers
Download this PDF file
Statistics
How to Cite
New Conjugacy Coefficient for Conjugate Gradient Method for Unconstrained Optimization. (2013). AL-Rafidain Journal of Computer Sciences and Mathematics, 10(2), 33-46. https://doi.org/10.33899/csmj.2013.163473
Copyright and Licensing

This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
New Conjugacy Coefficient for Conjugate Gradient Method for Unconstrained Optimization. (2013). AL-Rafidain Journal of Computer Sciences and Mathematics, 10(2), 33-46. https://doi.org/10.33899/csmj.2013.163473





