A new Suggested Conjugate Gradient Algorithm with Logistic Mapping

Authors

  • Dlovan H. Omar University of Zakho

Keywords:

Unconstrained Optimization, Conjugate Gradient Method, Logistic Mapping

Abstract

In this paper, we will use logistic mapping to find new conjugate gradient coefficients for unconstrained optimization.

Author Biography

Dlovan H. Omar, University of Zakho

Department of Mathematics, Faculty of Science, University of Zakho, Kurdistan Region – Iraq.

References

Fletcher,R.&Reeves, C. (1964). Function minimization by conjugate gradients. J. Compute., 7, 149–154.
Fletcher, R. (1987). Practical Methods of Optimization, Vol I: Unconstrained Optimization. New York: Wiley.
Hestenes,M.R.&Stiefel, E. L. (1952) Method of conjugate gradient for solving linear systems. J. Res. Natl.Bur. Stand., 49, 409–432.
Hui-juan LU, Zhang Huo-ming, MA Long-hua,(2005). A new optimization algorithm based on chaos,
Polak,B.&Ribiere, G. (1969). Note surla convergence des methods' de directions conjugu´ees. Rev. Fr.Imform. Rech. Oper., 16, 35–43.
Wolfe P. (1969). Convergence conditions for ascent method, SIAM Rev. 11, pp. 226-235Zhejiang University, Hangzhou 310027, China.

Downloads

Published

2016-12-30

How to Cite

Omar, D. H. (2016). A new Suggested Conjugate Gradient Algorithm with Logistic Mapping. Science Journal of University of Zakho, 4(2), 244–247. Retrieved from https://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/356

Issue

Vol. 4 No. 2 (2016): December, 2016

Section

Science Journal of University of Zakho

License

Copyright (c) 2016 Dlovan H. Omar

Creative Commons License

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.