Enriched Algorithms for Large Scale Unconstrained Optimization

Al-Bayati, Abbas Y.; Mohammad, Omar B.

doi:10.33899/csmj.2007.164001

	Enriched Algorithms for Large Scale Unconstrained Optimization
AL-Rafidain Journal of Computer Sciences and Mathematics
Article 10, Volume 4, Issue 1, 2007, Pages 11-37 PDF (582.44 K)
Document Type: Research Paper
DOI: 10.33899/csmj.2007.164001
Authors
Abbas Y. Al-Bayati¹; Omar B. Mohammad²
¹College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq
²College of Computer Sciences and Mathematics University of Mosul, Iraq
Abstract
A new method for solving Large-Scale problems in the unconstrained optimization has been proposed in this research depending on the BFGS method. The limited memory is used in the BFGS method by multiplying the BFGS matrix by a vector to obtain vectors instead of matrices and only two vectors can be stored, by modifying the algorithm given by Nocedal J (1999). The purpose of this algorithm is to enable us to solving the Large-Scale Problems, as it is obvious to everyone that the computer can store millions of vectors, whereas its ability in storing matrices is limited. The present method in this research is applied on seven nonlinear functions in order to evaluate the method efficiency in the numbers of iterations (NOI), number of functions (NOF) and function value and comparing it with the standard BFGS method after updating. This method has been applied on functions with variables till 1000000 and more than that. From comparing the results, we fined that this algorithm was the best.
Keywords
unconstrained Optimization; Large Scale; Enriched Algorithms

Statistics Article View: 316 PDF Download: 260