New Conjugate Gradient Method for Unconstrained Optimization with Logistic Mapping

  • Shareef G. Shareef University of Zakho
  • Hussein A. Khatab University of Zakho
  • Sawsan S. Ismael University of Mosul
Keywords: Unconstrained Optimization, Conjugate Gradient Method, Descent Condition, Logistic Mapping

Abstract

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) .

Author Biographies

Shareef G. Shareef, University of Zakho

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

Hussein A. Khatab, University of Zakho

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

Sawsan S. Ismael, University of Mosul

Department of Mathmatics, College of Education, University of Mosul, Iraq.

References

Dai Y. H., and Y. X. Yuan, (1999). A nonlinear conjugate gradient method with a strong global convergence property, SIAM Journal on optimization, 10, pp. 177-182.

Fletcher R. ,(1987). Practical Methods of Optimization, Vol. 1: Unconstrained Optimization(New York: Wiley and Sons).

Fletcher R. and C. Reeves ,(1964). Function minimization by conjugate gradients, Computer Journal, 7, pp. 149-154.

Hager W., H.C. Zhang,(2006). A survey of nonlinear conjugate gradient methods, Pacific Journal of Optimization, 2, pp. 35-58.

Hestenes M. R .and E. Stiefel,(1952). Method of conjugate gradient for solving linear equation, J. Res. Nat. Bur. Stand. 49, 409-436.

Jorge Nocedal and Stephen J. Wright,(1999). Numerical Optimization,Springer-Verlag New York, Inc.

Liu Y. and C. Storey,(1992). Efficient generalized conjugate gradient algorithms part 1: Theory, J. Comput. Appl. Math. 69 , pp. 129-137.

LU Hui-juan, ZHANG Huo-ming, MA Long-hua,(2005). A new optimization algorithm based on chaos, Zhejiang University, Hangzhou 310027, China.

Polayk B., (1969).The conjugate gradient method in extreme problems, USSR Computational Mathematics and Mathematical Physics, pp. 94-112.

Polak B. and G. Ribiere, (1969). Note sur la convergence des methods de directions conjuguees, Reue Francaise deRecherche Operationnele, 16,pp. 35-43.
Published
2016-06-30
How to Cite
Shareef, S., Khatab, H., & Ismael, S. (2016). New Conjugate Gradient Method for Unconstrained Optimization with Logistic Mapping. Science Journal of University of Zakho, 4(1), 133 - 136. Retrieved from https://sjuoz.uoz.edu.krd/index.php/sjuoz/article/view/314
Section
Science Journal of University of Zakho