TARU PUBLICATIONS
Journal of Interdisciplinary Mathematics cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-012X·ISSN (Print): 0972-0502

Freq.: MONTHLY - Publishes the methodological and theoretical role of mathematics and mathematical applications underpinning scientific research.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

A new optimal Dai-Liao algorithm for solving iteration problems

* ,

* Corresponding author · click or hover a name for details

pp. 363–368Vol. 28Issue 1February 2025DOI: 10.47974/JIM-2131XML
Received:
15 Oct 2024
Published Online:
13 Feb 2025
Article type:
Research Article
Language:
EN
Article no.:
JIM-2131
Pages:
363–368

Abstract

The conjugate gradient approach is fascinating when applied to mathematical formulations. An innovative formula based on curvature needs has been developed. In contrast to the Dai-Liao method, which uses gradient and difference point data in its computations, the improved approach will show more efficiency by using function information. Experimental numerical studies are approved to demonstrate the efficiency of the suggested method.

Keywords

Subject Classifications

90C3065K0549M37

References

[1] B. A. Hassan and A. A. Saad, “Elastic conjugate gradient methods to solve iteration problems,” J. Interdiscip. Math., vol. 26, no. 6 (2023). https://doi.org/10.47974/JIM-1619.
[2] B. A. Hassan, H. N. Jabbar, Y. A. Laylani, “Upscaling parameters for conjugate gradient method in unconstrained optimization,” J. Interdiscip. Math., vol. 26, no. 6 (2023). [Online]. Available: https://doi.org/10.47974/JIM-1615.
[3] M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems,” J Res Natl Bur Stand (1934), vol. 49, no. 6 (1952). https://doi.org/10.6028/jres.049.044.
[4] B. A. Hassan and A. A. Saad, “Explaining new parameters conjugate analysis based on the quadratic model,” J. Interdiscip. Math., vol. 26, no. 6 (2023). [Online]. Available: https://doi.org/10.47974/JIM-1620.
[5] Y. H. Dai and L. Z. Liao, “New conjugacy conditions and related nonlinear conjugate gradient methods,” Appl Math Optim, vol. 43, no. 1 (2001). [Online]. Available: https://doi.org/10.1007/s002450010019.
[6] L. Zhang, W. Zhou, D. H. Li, “A descent modified Polak-Ribière-Polyak conjugate gradient method and its global convergence,” IMA Journal of Numerical Analysis, vol. 26, no. 4 (2006). [Online]. Available: https://doi.org/10.1093/imanum/drl016.
[7] B. A. Hassan and H. A. Alashoor, “Pediment New Parameters for a Conjugate Gradient Method and Using it in Restoring Distorted Images,” in 2022 8th International Conference on Contemporary Information Technology and Mathematics, ICCITM 2022 (2022). [Online]. Available: https://doi.org/10.1109/ICCITM56309.2022.10031853.
[8] A. Perry, “Technical Note—A Modified Conjugate Gradient Algorithm,” Operations Research, vol. 26, no. 6, pp. 1073–1078 (1978). [Online]. Available: https://doi.org/10.1287/opre.26.6.1073.
[9] N. A.-Adv. Model. Optim and undefined 2008, “An unconstrained optimization test functions collection,” CiteseerN AndreiAdv. Model. Optim, 2008 Dec. 17 (2024).
[10] E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical Programming, Series B, vol. 91, no. 2 (2002). [Online]. Available: https://doi.org/10.1007/s101070100263.
[11] S. Hussain, F. Afzal, D. Afzal, M.Cancan, S. Ediz, M.R.Farahani, “Analyzing the boron triangular nanotube through topological indices via M-polynomial,” J. Discrete Math. Sci. Cryptography, vol. 24, no. 2, pp. 415-426 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2021.1882158.
[12] H. Yang, X. Zhang, “The independent domination numbers of strong product of two cycles,” J. Discrete Math. Sci. Cryptography, vol. 21, no. 7-8, pp. 1495-1507 (2018). [Online]. Available: https://doi.org /10.1080/09720529.2017.1316988. 
[13] F. Afzal, S. Rukh, D. Afzal, M. R. Farahani, M. Cancan, S. Ediz, “A study of non-commutative Von-Neumann regular rings,” J. Inf. Optim. Sci., vol. 42, no. 7, pp. 1425-1436 (2021). [Online]. Available: https://doi.org/10.1080/02522667.2021.1896650. 
[14] M. Nadeem, S. Ahmad, M. K. Siddiqui, M. A. Ali, M. R. Farahani, A. J. M. Khalaf, “On some applications related with algebraic structures through different well known graphs,” J. Discrete Math. Sci. Cryptography, vol. 24, no. 2, pp. 451-471 (2021). [Online]. Available: https://doi.org/10.1080/0972052. 
[15] A. H. Alwan, “Small intersection graph of subsemimodules of a semi¬module,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2022, no. 1, pp. 15-22 (2022). 
[16] S. Ediz, M. Cancan, M. R. Farahani, “Eccentric connectivity and connective eccentricity indices of generalized Petersen graphs,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2021, no. 1, pp. 1-6 (2021). 
[17] R. Ponraj, S. Prabhu, M. Sivakumar, “Pair mean cordial label-ing of total graph of some graphs and prism-related graphs,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 181-192 (2024). 
[18] F. O. Oduol, I. O. Okoth, “Counting vertices among all noncross¬ing trees by levels and degrees,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 193-212 (2024).

Views: 137Downloads: 7Citations: 0