Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

NEW CONJUGATE GRADIENT METHOD FOR ACCELERATED CONVERGENCE AND COMPUTATIONAL EFFICIENCY IN UNCONSTRAINED OPTIMIZATION PROBLEMS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 1 (2025) · hlm. 0481–0492

DOI
10.30598/barekengvol20iss1pp0481-0492
ISSN
2615-3017, 1978-7227
Terbit
2025-11-24
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Conjugate gradient (CG) algorithms play an important role in solving large-scale unconstrained optimization problems due to their low memory requirements and strong convergence properties. However, many classical CG algorithms suffer from inefficiencies when dealing with complex or ill-conditioned objective functions. This paper addresses this challenge by proposing a new conjugate gradient method that combines the descent direction of traditional CG algorithms with Newton-type updates to improve convergence and computational efficiency. The proposed method is constructed to ensure sufficient descent at each iteration and global convergence under standard assumptions. By integrating the modified Newton update mechanism, the method effectively accelerates convergence without incurring the high computational cost typically associated with full Newton methods. To evaluate the performance of the proposed approach, we conducted extensive numerical experiments using a collection of well-known benchmark functions from the CUTEr test suite. The results show that the new method consistently outperforms the classical Hestenes-Stiefel method in terms of CPU time, number of function evaluations, and iteration count. These findings confirm the method’s potential as an efficient and robust alternative for solving large-scale unconstrained optimization problems.

Jaringan kolaborasi para penulis

20 penulis · 57 tautan kepenulisan bersama · 28 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Mosul
  • University of Kirkuk
  • University of Tikrit
  • University of Zakho
  • Sohar University
  • Kuwait Technical College
  • Universiti Utara Malaysia
  • Organisasi lain
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Issam A. R. MoghrabiKuwait Technical College2
Yeldez J. SubhiNorthern Technical University2
Ali Fareed JameelUniversiti Utara Malaysia1
Muhammad A. ShihabUniversity of Tikrit1
Wafaa M. TahaUniversity of Kirkuk1
Raad A. HameedUniversity of Tikrit1
Hawraz Nadhim JabbarUniversity of Kirkuk1
Yoksal A. LaylaniUniversity of Kirkuk1
Ali Joma AlissaUniversity of Aleppo1
Muhammad Y. WaziriAfiliasi tidak diketahui1
Rabiu Bashir YunusAfiliasi tidak diketahui1
Umar A OmesaAfiliasi tidak diketahui1
E B GuduAfiliasi tidak diketahui1
S L FakaiAfiliasi tidak diketahui1
Elissa Nadia MadiSultan Zainal Abidin University1
Manal I. MohammedUniversity of Mosul1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">NEW CONJUGATE GRADIENT METHOD FOR ACCELERATED CONVERGENCE AND COMPUTATIONAL EFFICIENCY IN UNCONSTRAINED OPTIMIZATION PROBLEMS</dc:title>
	<dc:creator>Hassan, Basim A.</dc:creator>
	<dc:creator>Ibrahim, Alaa Luqman</dc:creator>
	<dc:creator>Ameen, Thaair A.</dc:creator>
	<dc:creator>Sulaiman, Ibrahim Mohammed</dc:creator>
	<dc:description xml:lang="en-US">Conjugate gradient (CG) algorithms play an important role in solving large-scale unconstrained optimization problems due to their low memory requirements and strong convergence properties. However, many classical CG algorithms suffer from inefficiencies when dealing with complex or ill-conditioned objective functions. This paper addresses this challenge by proposing a new conjugate gradient method that combines the descent direction of traditional CG algorithms with Newton-type updates to improve convergence and computational efficiency. The proposed method is constructed to ensure sufficient descent at each iteration and global convergence under standard assumptions. By integrating the modified Newton update mechanism, the method effectively accelerates convergence without incurring the high computational cost typically associated with full Newton methods. To evaluate the performance of the proposed approach, we conducted extensive numerical experiments using a collection of well-known benchmark functions from the CUTEr test suite. The results show that the new method consistently outperforms the classical Hestenes-Stiefel method in terms of CPU time, number of function evaluations, and iteration count. These findings confirm the method’s potential as an efficient and robust alternative for solving large-scale unconstrained optimization problems.
&amp;nbsp;</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-11-24</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18453</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss1pp0481-0492</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 1 (2026): BAREKENG: Journal of Mathematics and Its Application; 0481-0492</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss1year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18453/11827</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Basim A. Hassan, Alaa Luqman Ibrahim, Thaair A. Ameen, Ibrahim Mohammed Sulaiman</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>