Mosul University
  • Register
  • Login
  • العربیة

AL-Rafidain Journal of Computer Sciences and Mathematics

Notice

As part of Open Journals’ initiatives, we create website for scholarly open access journals. If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at https://ejournalplus.com or
send us an email to info@ejournalplus.com

We will contact you soon

  1. Home
  2. Volume 4, Issue 1
  3. Authors

Current Issue

By Issue

By Subject

Keyword Index

Author Index

Indexing Databases XML

About Journal

Aims and Scope

Editorial Board

Editorial Staff

Publication Ethics

Indexing and Abstracting

Related Links

Peer Review Process

News

Enriched Algorithms for Large Scale Unconstrained Optimization

    Abbas Y. Al-Bayati Omar B. Mohammad

AL-Rafidain Journal of Computer Sciences and Mathematics, 2007, Volume 4, Issue 1, Pages 11-37
10.33899/csmj.2007.164001

  • Show Article
  • Download
  • Cite
  • Statistics
  • Share

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
  • PDF (582 K)
  • XML
(2007). Enriched Algorithms for Large Scale Unconstrained Optimization. AL-Rafidain Journal of Computer Sciences and Mathematics, 4(1), 11-37. doi: 10.33899/csmj.2007.164001
Abbas Y. Al-Bayati; Omar B. Mohammad. "Enriched Algorithms for Large Scale Unconstrained Optimization". AL-Rafidain Journal of Computer Sciences and Mathematics, 4, 1, 2007, 11-37. doi: 10.33899/csmj.2007.164001
(2007). 'Enriched Algorithms for Large Scale Unconstrained Optimization', AL-Rafidain Journal of Computer Sciences and Mathematics, 4(1), pp. 11-37. doi: 10.33899/csmj.2007.164001
Enriched Algorithms for Large Scale Unconstrained Optimization. AL-Rafidain Journal of Computer Sciences and Mathematics, 2007; 4(1): 11-37. doi: 10.33899/csmj.2007.164001
  • RIS
  • EndNote
  • BibTeX
  • APA
  • MLA
  • Harvard
  • Vancouver
  • Article View: 41
  • PDF Download: 78
  • LinkedIn
  • Twitter
  • Facebook
  • Google
  • Telegram
  • Home
  • Glossary
  • News
  • Aims and Scope
  • Privacy Policy
  • Sitemap
This journal is licensed under a Creative Commons Attribution 4.0 International (CC-BY 4.0)

Powered by eJournalPlus