Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Resources
  3. Journals
  4. Applied Mathematics and Computational Intelligence (AMCI)
  5. A New Hybrid Three-Term HS-DY Conjugate Gradient In Solving Unconstrained Optimization Problems
 
Options

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

Journal
Applied Mathematics and Computational Intelligence (AMCI)
ISSN
2289-1315
Date Issued
2024-02
Author(s)
Muhammad Aqiil Iqmal Bin Ishak
Universiti Putra Malaysia
Siti Mahani Binti Marjugi
Universiti Putra Malaysia
DOI
https://doi.org/10.58915/amci.v13iNo.1.493
Handle (URI)
https://ejournal.unimap.edu.my/index.php/amci/article/view/493/357
https://hdl.handle.net/20.500.14170/14980
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.
Subjects
  • Unconstrained Optimiz...

  • Three-Term Conjugate ...

  • Line Search

  • Global Convergence

  • Memoryless Quasi-Newt...

File(s)
52-68+A+New+Hybrid+Three-Term+HS-DY+Conjugate+Gradient+In+Solving+Unconstrained+Optimization+Problems.pdf (522.7 KB)
Views
1
Acquisition Date
Jan 12, 2026
View Details
Downloads
4
Last Month
2
Acquisition Date
Jan 12, 2026
View Details
google-scholar
  • About Us
  • Contact Us
  • Policies