Khadizah Ghazali, and Jumat Sulaiman, and Yosza Dasril, and Darmesah Gabda, (2020) An Improvement of Computing Newton’s Direction for Finding Unconstrained Minimizer for LargeScale Problems with an Arrowhead Hessian Matrix. In: Computational Science and Technology.

Text
An Improvement of Computing Newton’s Direction for Finding Unconstrained Minimizer.pdf Download (1MB)  Preview 
Abstract
In largescale problems, classical Newton’s method requires solving a large linear system of equations resulting from determining the Newton direction. This process often related as a very complicated process, and it requires a lot of computation (either in time calculation or memory requirement per iteration). Thus to avoid this problem, we proposed an improved way to calculate the Newton direction using an Accelerated Overrelaxation (AOR) point iterative method with two different parameters. To check the performance of our proposed Newton’s direction, we used the Newton method with AOR iteration for solving unconstrained optimization problems with its Hessian is in arrowhead form and compared it with a combination of the Newton method with GaussSeidel (GS) iteration and the Newton method with Successive Over Relaxation (SOR) iteration. Finally, comparison results show that our proposed technique is significantly more efficient and more reliable than reference methods.
Item Type:  Conference or Workshop Item (UNSPECIFIED) 

Uncontrolled Keywords:  Newton method , AOR iteration , Unconstrained optimization problems , Largescale optimization , Arrowhead matrix 
Subjects:  Q Science > QA Mathematics > QA75 Electronic computers. Computer science 
Divisions:  FACULTY > Faculty of Science and Natural Resources 
Depositing User:  Noraini 
Date Deposited:  01 Jul 2020 03:47 
Last Modified:  01 Jul 2020 03:47 
URI:  http://eprints.ums.edu.my/id/eprint/25538 
Actions (login required)
View Item 