A new secant method for minima one variable problems

Sulaiman, Barah M.; Hassan, Basim A.; Sulaiman, Ranen M.

doi:10.47974/JIM-1601

Open Access Research Article

A new secant method for minima one variable problems

^*Barah M. SulaimanCorresponding authorbarah_mahmood82@uomosul.edu.iqDepartment of Mathematics College of Computer Science & Mathematics University of MosulDepartment of Mathematics College of Computer Science and Mathematics University of MosulMosul, IraqView full profile → , Basim A. Hassanbasimah@uomosul.edu.iqDepartment of Mathematics College of Computer Science & Mathematics University of MosulDepartment of Mathematics College of Computer Sciences and Mathematics University of MosulMosul, 41002, Iraq0000-0003-3510-9818View full profile → , Ranen M. Sulaimanranen.sulyman@uomosul.edu.iqDepartment of Mathematics College of Computer Science & Mathematics University of MosulMosul, IraqView full profile →

* Corresponding author · click or hover a name for details

pp. 1015–1021Vol. 26Issue 6September 2023DOI: 10.47974/JIM-1601XML

Published Online:: 03 Aug 2023
Article type:: Research Article
Language:: EN
Article no.:: JIM-1601
Pages:: 1015–1021

Abstract

In single variable situations, the traditional Newton’s approaches are the most popular. The new secant approach is based on the 2nd order Taylor expansion, which eliminates the necessity to compute the second derivative. Numerical tests have shown that the new secant approach is both numerical and effective when compared to the existing Newton method (N-method).

Keywords

Secant method Minimization method Test problems

Subject Classifications

Primary 93A30Secondary 49K15

Acknowledgements

FRH-P895H52

References

[1] B. A. Hassan and E. S. Al-Rawi, A modified Newton’s method for solving functions of one variable, Italian Journal of Pure and Applied Mathematics, 577-582 (2001).
[2] E. Kahya and J. Chen, A modified Secant method for unconstrained optimization, Applied Mathematics and Computation, 176, 2 1000-1004 (2007), https://doi.org/10.1016/j.amc.2006.08.042.
[3] E. K. Chong and S. H. Zak, An introduction to optimization. John Wiley & Sons (1980).
[4] E. Kahya, Modified Secant-type methods for unconstrained optimization, Applied Mathematics and Computation, 181, 2, 1349-1356 (Oct. 2006), https://doi.org/10.1016/j.amc.2006.03.003.
[5] M. Frontini and E. Sormani, Some variant of Newton’s method with third-order convergence, Applied Mathematics and Computation, 140, 2-3, 419-426 (2003), https://doi.org/10.1016/S0096-3003(02)00238-2.
[6] M. Frontini, E. Sormani, Modified Newton’s method with third-order convergence and multiple roots, Journal of Computational and Applied Mathematics, 156(2), 345-354 (2003), https://doi.org/10.1016/S0377-0427(02)00920-2.
[7] H. H. Homeier, A modified Newton method with cubic convergence: the multivariate case, Journal of Computational and Applied Mathematics, 169, 1, 161-169 (2004), https://doi.org/10.1016/j.cam.2003.12.041.
[8] H. H. Homeier, On Newton-type methods with cubic convergence, Journal of Computational and Applied Mathematics, 176, 2, 425-432 (2005), https://doi.org/10.1016/j.cam.2004.07.027.
[9] A. Y. Özban, Some new variants of Newton’s method, Applied Mathematics Letters, 17, 6, 677-682 (2004), https://doi.org/10.1016/S0893-9659(04)90104-8.
[10] S. S. Rao, Engineering optimization: theory and practice, 4th ed. John Wiley & Sons (2019).
[11] R. L. Rardin and R. L. Rardin, Optimization in operations research, 166. Prentice Hall Upper Saddle River, NJ (1998).
[12] D. Razieh, B. Narges, and M. Mohammad, A new modified BFGS method for solving system of nonlinear equations, Journal of Interdisciplinary Mathematics, 22, 75-89 (2019), https://doi.org/10.1080/09720502.2019.1574065.
[13] S. Dhankhar and M. K. Gupta, A statistically based sentence scoring method using mathematical combination for extractive Hindi text summarization, Journal of Interdisciplinary Mathematics, 25, 3, 773-790 (2022), https://doi.org/10.1080/09720502.2021.2015096.
[14] S. Weerakoon and T. Fernando, A variant of Newton’s method with accelerated third-order convergence, Applied Mathematics Letters, 13, 8, 87-93 (2000), https://doi.org/10.1016/S0893-9659(00)00100-2.
[15] W. Gao and M. R. Farahani, The hyper-Zagreb index for an infinite family of nanostar dendrimer, Journal of Discrete Mathematical Sciences and Cryptography, 20, 2, 515-523 (2017), https://doi.org/10.1080/09720529.2016.1220088.
[16] W. Gao, L. Shi, and M. R. Farahani, Szeged Related Indices of TUAC 6 [p, q], Journal of Discrete Mathematical Sciences and Cryptography, 20, 2, 553-563 (Feb. 2017), https://doi.org/10.1080/09720529.2016.1228312.
[17] Y.-X. Yuan, A Modified BFGS Algorithm for Unconstrained Optimization, IMA J Numer Anal, 11, 3, 325-332 (1991), https://doi.org/10.1093/imanum/11.3.325.
[18] X. Zhang, F. Ahmed Shah, Y. Li, L. Yan, A.Q. Baig, M.R. Farahani. A family of fifth-order convergent methods for solving nonlinear equations using variational iteration technique. Journal of Information and Optimization Sciences, 39(3), 673-694 (2018). https://doi.org/10.1080/02522667.2018.1443628
[19] M.S. Sardar, M. Alaeiyan, M.R. Farahani, M. Cancan, S. Ediz. Resistance distance in some classes of rooted product graphs obtained by Laplacian generalized inverse method. Journal of Information and Optimization Sciences 42(7), 1447-1467 (2021). https://doi.org/10.1080/02522667.2021.1899210
[20] S. Ediz, İ. Çiftçi, M.Cancan, M.R.Farahani, On k-total distance degrees and k-total Wiener polarity index. Journal of Information and Optimization Sciences. 42(7), 1469-1477 (2021). https://doi.org/10.1080/02522667.2021.1896652
[21] A. Alsinai, H.M.U. Rehman, Y. Manzoor, M. Cancan, Z. Taş, M.R. Farahani, Sharp upper bounds on forgotten and SK indices of cactus graph, Journal of Discrete Mathematical Sciences and Cryptography. 1-22 (2022). https://doi.org/10.1080/09720529.2022.2027605

Views: 288Downloads: 5Citations: 0