New Conjugate Gradient Method for Unconstrained Optimization with Logistic Mapping
Keywords:
Unconstrained Optimization, Conjugate Gradient Method, Descent Condition, Logistic MappingAbstract
In this paper , we suggested a new conjugate gradient algorithm for unconstrained optimization based on logistic mapping, descent condition and sufficient descent condition for our method are provided. Numerical results show that our presented algorithm is more efficient for solving nonlinear unconstrained optimization problems comparing with (DY) .
Downloads
Download data is not yet available.
Downloads
Published
2016-06-30
Issue
Section
Science Journal of University of Zakho
License
Copyright (c) 2016 Shareef G. Shareef, Hussein A. Khatab, Sawsan S. Ismael
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY-NC-SA 4.0] that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work, with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online.
How to Cite
Shareef, S. G., Khatab, H. A., & Ismael, S. S. (2016). New Conjugate Gradient Method for Unconstrained Optimization with Logistic Mapping. Science Journal of University of Zakho, 4(1), 133-136. https://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/314
