A STEP-LENGTH FORMULA FOR CONJUGATE GRADIENT METHODS

Authors

  • Adam Ajimoti Ishaq Department of Physical Sciences, Al-Hikmah University, Ilorin, Nigeria
  • Tolulope Latunde Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti, Nigeria
  • Kazeem Babatunde Akande Department of Science and Research, Iqra College, Ilorin, Nigeria

DOI:

https://doi.org/10.24191/mjoc.v5i1.7715

Keywords:

Step-length, Conjugate Gradient Method, Unconstrained Optimization Problem

Abstract

A newly step-length formula is proposed for implementing conjugate gradient methods’ algorithm to solve unconstrained optimization problems. The unified formula for obtaining step-length does not involve any matrix operation. Numerical results obtained are graphically illustrated using performance profiling software. This showed that the new formula performs efficiently in terms of computational efforts and execution time compared with some existing formulae for obtaining the step-length without line search procedures.

Published

2020-06-01

Issue

Vol. 5 No. 1 (2020): MJOC Volume 5(1) 2020

Section

Articles

License

Copyright (c) 2020 Adam Ajimoti Ishaq, Tolulope Latunde, Kazeem Babatunde Akande

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

How to Cite

Adam Ajimoti Ishaq, Tolulope Latunde, & Kazeem Babatunde Akande. (2020). A STEP-LENGTH FORMULA FOR CONJUGATE GRADIENT METHODS. Malaysian Journal of Computing, 5(1). https://doi.org/10.24191/mjoc.v5i1.7715