A New Hybrid Three-Term HS-DY Conjugate Gradient In Solving Unconstrained Optimization Problems

Authors

  • Muhammad Aqiil Iqmal Bin Ishak Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, Jalan Universiti 1, 43400 Serdang, Selangor, Malaysia.
  • Siti Mahani Binti Marjugi Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, Jalan Universiti 1, 43400 Serdang, Selangor, Malaysia.

DOI:

https://doi.org/10.58915/amci.v13iNo.1.493

Abstract

Conjugate Gradient (CG) method is an interesting tool to solve optimization problems in many fields, such design, economics, physics and engineering. Until now, many CG methods have been developed to improve computational performance and have applied in the real-world problems. Combining two CG parameters with distinct denominators may result in non-optimal outcomes and congestion.In this paper, a new hybrid three-term CG method is proposed for solving unconstrained optimization problems. The hybrid threeterm search direction combines Hestenes-Stiefel (HS) and Dai-Yuan (DY) CG parameters which standardized by using a spectral to determine the suitable conjugate parameter choice and it satisfies the sufficient descent  condition. Additionally, the global convergence was proved under standard Wolfe conditions and some suitable assumptions. Furthermore, the numerical experiments showed the proposed method is most robust and superior efficiency compared to some existing methods.

Keywords:

Unconstrained Optimization, Three-Term Conjugate Gradient, Memoryless QuasiNewton Method, Line Search, Global Convergence

Downloads

Published

2024-02-14

How to Cite

Muhammad Aqiil Iqmal Bin Ishak, & Siti Mahani Binti Marjugi. (2024). A New Hybrid Three-Term HS-DY Conjugate Gradient In Solving Unconstrained Optimization Problems. Applied Mathematics and Computational Intelligence (AMCI), 13(No.1), 52–68. https://doi.org/10.58915/amci.v13iNo.1.493