The bridge between Newton's method and Newton-Raphson's method in numerical optimization
Keywords:
Newton's method, Newton-Raphson's method, Numerical OptimizationAbstract
One of the most important tools for numerical analysis in this study was the Newton-Raphson's method mathematical model, which was used for a variety of purposes including practical research, data mining of the approach's core principles, convergence findings. Unconstrained minimization, constrained equality issues, convex programming and inner point techniques are a few of the optimization topics we study in-depth at our lab. Instead, the details of these approaches and how they might be used to numerical optimization with Python are explored in greater depth. The concept of linear approximation underpins the process of solving numerical functions and selecting the optimal answer. This procedure, when applied effectively, is commonly employed in homes that have been demolished.
Downloads
References
Kutz, J. N. (2013). Data-driven modeling & scientific computation: methods for complex systems & big data. Oxford University Press.
R. L. Burden and J. D. Faires, Numerical Analysis (Brooks/Cole, 1997).
R. K. Ahuja, T. L. Magnanti, AND J. B. ORLIN, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, N.J., 1993.
H. Akaike, On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method, Annals of the Institute of Statistical Mathematics, 11 (1959), pp. 1–17. DOI: https://doi.org/10.1007/BF01831719
M. AL-BAALI, Descent property and global convergence of the Fletcher-Reeves method with inexact line search, I.M.A. Journal on Numerical Analysis, 5 (1985), pp. 121–124. DOI: https://doi.org/10.1093/imanum/5.1.121
E. D. ANDERSEN AND K. D. Andersen, Presolving in linear programming, Mathematical Programming, 71 (1995), pp. 221–245. DOI: https://doi.org/10.1007/BF01586000
The Mosek interior point optimizer for linear programming: an implementation of the homogeneous algorithm, in High Performance Optimization, T. T. H. Frenk, K. Roos and S. Zhang, eds., Kluwer Academic Publishers, 2000, pp. 197–232. DOI: https://doi.org/10.1007/978-1-4757-3216-0_8
E. D. Andersen, J. Gondzio, C. Mesz 'Aros', And X. Xu, Implementation of interior-point methods for large scale linear programming, in Interior Point Methods in Mathematical Programming, T. Terlaky, ed., Kluwer, 1996, ch. 6, pp. 189–252. DOI: https://doi.org/10.1007/978-1-4613-3449-1_6
E. Anderson, Z. BAI, C. Bischof, J. Demmel, J. Dongarra, J. du Croz, A. Greenbaum, S. Hammarling, A. Mckenney, S. Ostrouchov, AND D. Sorensen, Lapack User's Guide, SIAM, Philadelphia, 1992.
R EFERENCES M. ANITESCU, On solving mathematical programs with complementarity constraints as nonlinear programs, SIAM Journal on Optimization, 15 (2005), pp. 1203–1236. DOI: https://doi.org/10.1137/S1052623402401221
Arki Consulting And Development A/S, CONOPT version 3, 2004.
B. M. AVERICK, R. G. CARTER, J. J. MORE', AND G. XUE, The MINPACK-2 test problem collection,
Al-Jilawi, A. S., & Abd Alsharify, F. H. (2022). Review of Mathematical Modelling Techniques with Applications in Biosciences. Iraqi Journal For Computer Science and Mathematics, 3(1), 135-144.
Alridha, A., Wahbi, F. A., & Kadhim, M. K. (2021). Training analysis of optimization models in machine learning. International Journal of Nonlinear Analysis and Applications, 12(2), 1453-1461.
Kadhim, M. K., Wahbi, F. A., & Hasan Alridha, A. (2022). Mathematical optimization modeling for estimating the incidence of clinical diseases. International Journal of Nonlinear Analysis and Applications, 13(1), 185-195.
Alridha, A., Salman, A. M., & Al-Jilawi, A. S. (2021, March). The Applications of NP-hardness optimizations problem. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012179). IOP Publishing. DOI: https://doi.org/10.1088/1742-6596/1818/1/012179
Salman, A. M., Alridha, A., & Hussain, A. H. (2021, March). Some Topics on Convex Optimization. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012171). IOP Publishing. DOI: https://doi.org/10.1088/1742-6596/1818/1/012171
Alridha, A., & Al-Jilawi, A. S. (2021, March). Mathematical Programming Computational for Solving NP-Hardness Problem. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012137). IOP Publishing. DOI: https://doi.org/10.1088/1742-6596/1818/1/012137
Published
How to Cite
Issue
Section
Copyright (c) 2022 International journal of health sciences
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Articles published in the International Journal of Health Sciences (IJHS) are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJHS right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.
Articles published in IJHS can be copied, communicated and shared in their published form for non-commercial purposes provided full attribution is given to the author and the journal. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
This copyright notice applies to articles published in IJHS volumes 4 onwards. Please read about the copyright notices for previous volumes under Journal History.
