Newton method with explicit group iteration for solving large scale unconstrained optimization problems

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Numerous numerical methods have been used to solve unconstrained optimization problems. The Explicit Group iteration is one of the numerical methods that has an advantage of the efficient block iteration scheme for solving any linear system. In this paper we applied a combination of the Newton method with two-point Explicit Group (2-point EG) iterative scheme for solving large scale unconstrained optimization problems. In order to evaluate the performance of this method, combination between Newton method with classical Iterative methods namely Jacobi and Gauss-Seidel iterations were used as reference method. The numerical results show that our proposed method is more efficient than the reference method in terms of execution time, number of iteration and absolute error.

Cite

CITATION STYLE

APA

Ghazali, K., Sulaiman, J., Dasril, Y., & Gabda, D. (2018). Newton method with explicit group iteration for solving large scale unconstrained optimization problems. In Journal of Physics: Conference Series (Vol. 1132). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1132/1/012056

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free