Hill Publishing Group | contact@hillpublisher.com

Hill Publishing Group

Location:Home / Journals / Journal of Applied Mathematics and Computation /

DOI:10.26855/jamc.2018.09.002

New Hybrid Conjugate Gradient Method as A Convex Combination of HS and FR Methods

Date: September 27,2018 |Hits: 2626 Download PDF How to cite this paper
Snezana S. Djordjevic

1Faculty of Technology, University of Nis, 16000 Leskovac, Serbia
*Corresponding author: Snezana S. Djordjevic
Email: snezanadjordjevic1971@gmail.com

Abstract

In this paper we present a new hybrid conjugate gradient algorithm for unconstrained optimization. This method is a convex combination of Hestenes-Stiefel conjugate gradient method and Fletcher-Reeves conjugate gradient method. The parameter  is chosen in such a way that the search direction satisfies the condition of the Newton direction. The strong Wolfe line search conditions are used. The global convergence of new method is proved.

Numerical comparisons show that the present hybrid conjugate gradient algorithm is the efficient one.

References

 

How to cite this paper

New Hybrid Conjugate Gradient Method as A Convex Combination of HS and FR Methods

How to cite this paper: Snezana, S.D. (2018) New Hybrid Conjugate Gradient Method as A Convex Combination of HS and FR Methods. Journal of Applied Mathematics and Computation, 2(9), 366-378.
DOI: 10.26855/jamc.2018.09.002

Free HPG Newsletters

Add your e-mail address to receive free newsletters from Hill Publishing Group.

Contact us

Hill Publishing Group

8825 53rd Ave

Elmhurst, NY 11373, USA

E-mail: contact@hillpublisher.com

Copyright © 2019 Hill Publishing Group Inc. All Rights Reserved.