An Improvement of Computing Newton’s Direction for Finding Unconstrained Minimizer for Large-Scale Problems with an Arrowhead Hessian Matrix
In large-scale 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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2020
|
| Online Access: | https://eprints.ums.edu.my/id/eprint/25538/1/An%20Improvement%20of%20Computing%20Newton%E2%80%99s%20Direction%20for%20Finding%20Unconstrained%20Minimizer.pdf https://eprints.ums.edu.my/id/eprint/25538/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In large-scale 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 Gauss-Seidel (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. |
|---|