Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

NUMERICAL AND CONVERGENCE ANALYSIS OF AN ENHANCED DAI-LIAO METHOD FOR UNCONSTRAINED OPTIMIZATION

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · hlm. 2993–3004

DOI
10.30598/barekengvol19iss4pp2993-3004
ISSN
2615-3017, 1978-7227
Terbit
2025-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Iterative algorithms play an important role in mathematical optimization, particularly in solving large-scale unconstrained optimization problems. The conjugate gradient (CG) methods are widely used due to their low memory requirements and efficiency. However, their performance highly depends on the choice of parameters that influence search directions and convergence speed. Despite their advantages, traditional CG algorithms sometimes suffer from slow convergence or poor accuracy, especially for ill-conditioned problems. The selection of conjugate gradient parameters significantly influences the performance, and there is a need to develop improved strategies to enhance solution accuracy and efficiency. This study constructs a new conjugate gradient parameter using the curvature condition to refine search directions and accelerate convergence. The proposed approach ensures a more effective balance between descent properties and numerical stability. Preliminary numerical experiments demonstrate that the proposed method outperforms classical CG variants regarding convergence rate and accuracy. The improved search directions lead to faster and more reliable optimization solutions. The newly developed conjugate gradient formula contributes to a more robust and efficient optimization. This advancement enhances the applicability of CG methods in solving complex optimization problems, paving the way for more effective computational efficiency.

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
  • Sohar University
  • Northern Technical 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
Thaair A. AmeenUniversity of Mosul2
Alaa Luqman IbrahimUniversity of Zakho2
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">NUMERICAL AND CONVERGENCE ANALYSIS OF AN ENHANCED DAI-LIAO METHOD FOR UNCONSTRAINED OPTIMIZATION</dc:title>
	<dc:creator>Hassan, Basim A.</dc:creator>
	<dc:creator>Sulaiman, Ibrahim Mohammed</dc:creator>
	<dc:creator>Subhi, Yeldez J.</dc:creator>
	<dc:description xml:lang="en-US">Iterative algorithms play an important role in mathematical optimization, particularly in solving large-scale unconstrained optimization problems. The conjugate gradient (CG) methods are widely used due to their low memory requirements and efficiency. However, their performance highly depends on the choice of parameters that influence search directions and convergence speed. Despite their advantages, traditional CG algorithms sometimes suffer from slow convergence or poor accuracy, especially for ill-conditioned problems. The selection of conjugate gradient parameters significantly influences the performance, and there is a need to develop improved strategies to enhance solution accuracy and efficiency. This study constructs a new conjugate gradient parameter using the curvature condition to refine search directions and accelerate convergence. The proposed approach ensures a more effective balance between descent properties and numerical stability. Preliminary numerical experiments demonstrate that the proposed method outperforms classical CG variants regarding convergence rate and accuracy. The improved search directions lead to faster and more reliable optimization solutions. The newly developed conjugate gradient formula contributes to a more robust and efficient optimization. This advancement enhances the applicability of CG methods in solving complex optimization problems, paving the way for more effective computational efficiency.
&amp;nbsp;</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</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/18332</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp2993-3004</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 2993-3004</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/18332/11170</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Basim A. Hassan, Sulaiman Mohammed Ibrahim, Yeldez J. Subhi</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>