Optimizing the modified conjugate gradient algorithm

Document Type : Research Paper


Master of Mathematics, Technical Institute of Kirkuk, Northern Technical University, Iraq


In this paper, an efficient GV1-CG is developed to optimizing the modified conjugate gradient algorithm by using a new conjugate property. This is to to increase the speed of the convergence and retain the characteristic mass convergence using the conjugate property. This used property is proposed to public functions as it is not necessary to be a quadratic and convex function. The descent sharp property and comprehensive convergence for the proposed improved algorithm have been proved. Numerical results on some test function indicate that the new CG-method outperforms many of the similar methods in this field.


[1] K.K. Abbo, Developing of Gradient Algorithm for Solving Unconstrained Non-Linear Problem with Artificial
Neural Networks, Doctoral thesis Faculty of Computing and Mathematics University of Mosul Sciences, (2010).
[2] N. Andrei, Conjugate Gradient Algorithms for Molecular Formation under Pair Wise Potential Minimization,
Center for Advanced Modeling and Optimization, (2007c).
[3] N. Andrei, An Unconstrained Optimization Test Function collection, Advance Model Optimization, Vol. (10),
(2008) 147 -161 .
[4] A.G. Buckley, A combined Conjugate Gradient Quasi – Newton Minimization Algorithm. Math, Prog. 15, (1987)
200 – 210.
[5] E.K.P. Chong and S.H. Zak, An Introduction to Optimization, Jon Wiley & Sons, Inc., Canada (2001).
[6] Y. Dai and Y. Yuan,A three Parameter family of hybrid conjugate gradient method, Mathematics of Computation,
70, (2001).
[7] Y. Dai and Y. Yuan, An Extended Class of Non – Linear CG Methods, to appear, Fifth International Conference
of Optimization, Hong – Kong (2010).
[8] Y. Dai and L.Z. Liao, New Conjugacy Conditions and Related Non- Linear Conjugate Gradient Methods, Applied
Mathematics and Optimization, Springer – Verlag, 43, New York, USA (2001)87- 101.
[9] R. Fletcher, Practical methods of optimization, A Wiley Inter Science Publication, Johan-Wiley & Sons, Inc.,
New York (1987).
[10] M.R. Hestenes and E. Stiefel, Method of Conjugate gradient for solving linear systems, Journal of Research of
the National Bureau of Standards, Vol. (5), No. (49), (1952) 409-436.
[11] Y. Hiroshi and S. Naoki, Anew Nonlinear Conjugate Gradient Method for Unconstrained Optimization, Journal
of the Optimization Research, Vol. (48), No. (4), (2005) 284-296.
[12] J. Kinsella, Course Notes for MS4327 Optimization, http://Jkcray. Maths.ul.ie/ms4327/slides.pdf 2011. INT [1],
[13] J. Nocedal and J.S. Wright, Numerical optimization series in operation research, 2nd edition, Springer-Verlag,
New York (2006).
[14] P. Pedregal, Introduction to Optimization, Springer-Verlag, Inc., New York, USA (2004).
[15] M.J.D. Powell, Restart Procedure for conjugate gradient method, Mathematical Programming, 12, (1977) 241-
254.[16] A.N. Shaker, Development of Modified Conjugate Gradient Algorithm, (2015).
[17] D.F. Shanno, On the convergence of a Conjugate Gradient Algorithm, SIAM. J. Number. Anal, 15 (1978).
[18] W. Sun and y. Yuan, Optimization Theory and Methods, Nonlinear Programming, Springer Science, Business
Media, LIC., New York (2006).
[19] G. Zoutendijk, Nonlinear Programming, Computational Methods, In: Integer and Nonlinear Programming, J.
Abadie Ed., North – Holland (1970) 37-86.
Volume 12, Special Issue
December 2021
Pages 97-108
  • Receive Date: 10 October 2020
  • Revise Date: 27 January 2021
  • Accept Date: 22 February 2021