Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

A THREE-TERM CONJUGATE GRADIENT METHOD FOR LARGE-SCALE MINIMIZATION IN ARTIFICIAL NEURAL NETWORKS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 3 (2025) · hlm. 1973–1988

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

Abstrak

Conjugate Gradient (CG) methods are widely used for solving unconstrained optimization problems due to their efficiency and low memory requirements. However, standard CG methods may not always guarantee sufficient descent condition, which can impact their robustness and convergence behavior. Additionally, their effectiveness in training artificial neural networks (ANNs) remains an area of interest. In response, this paper presents a three-term conjugate gradient (CG) method for unconstrained optimization problems. The new parameter is formulated so that the search direction satisfies the sufficient descent condition. The global convergence result of the new algorithm is discussed under suitable assumptions. To evaluate the performance of the new method we considered some standard test problems for unconstrained optimization and applied the proposed method to train different ANNs on some benchmark data sets contained in the NN toolbox. The experimental results show that performance is encouraging for both unconstrained minimization test problems and in training neural networks.

Jaringan kolaborasi para penulis

21 penulis · 59 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 Kirkuk
  • University of Mosul
  • University of Tikrit
  • Kuwait Technical College
  • Sohar University
  • Sultan Zainal Abidin University
  • 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
Basim Abbas HassanUniversity of Mosul3
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
Kamilu KamfaAfiliasi tidak diketahui1
Muhammad Auwal LawanAfiliasi tidak diketahui1
Yeldez J. SubhiNorthern Technical University1
Thaair A. AmeenUniversity of Mosul1
Alaa Luqman IbrahimUniversity of Zakho1

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">A THREE-TERM CONJUGATE GRADIENT METHOD FOR LARGE-SCALE MINIMIZATION IN ARTIFICIAL NEURAL NETWORKS</dc:title>
	<dc:creator>Omesa, Umar A</dc:creator>
	<dc:creator>Waziri, Muhammad Y.</dc:creator>
	<dc:creator>Moghrabi, Issam A. R.</dc:creator>
	<dc:creator>Ibrahim, Sulaiman M.</dc:creator>
	<dc:creator>E B, Gudu</dc:creator>
	<dc:creator>S L, Fakai</dc:creator>
	<dc:creator>Yunus, Rabiu Bashir</dc:creator>
	<dc:creator>Madi, Elissa Nadia</dc:creator>
	<dc:description xml:lang="en-US">Conjugate Gradient (CG) methods are widely used for solving unconstrained optimization problems due to their efficiency and low memory requirements. However, standard CG methods may not always guarantee sufficient descent condition, which can impact their robustness and convergence behavior. Additionally, their effectiveness in training artificial neural networks (ANNs) remains an area of interest. In response, this paper presents a three-term conjugate gradient (CG) method for unconstrained optimization problems. The new parameter is formulated so that the search direction satisfies the sufficient descent condition. The global convergence result of the new algorithm is discussed under suitable assumptions. To evaluate the performance of the new method we considered some standard test problems for unconstrained optimization and applied the proposed method to train different ANNs on some benchmark data sets contained in the NN toolbox. The experimental results show that performance is encouraging for both unconstrained minimization test problems and in training neural networks.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-07-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/17704</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss3pp1973-1988</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 3 (2025): BAREKENG: Journal of Mathematics and Its Application; 1973-1988</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss3year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17704/10841</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Umar A Omesa, Muhammad Y. Waziri, Issam A. R. Moghrabi, Sulaiman M. Ibrahim, Gudu E B, Fakai S L, Rabiu Bashir Yunus, Elissa Nadia Madi</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>