Parallel direct search methods

Joint Authors

al-Nimah, Muhammad W.
Khalaf, Bashir Muhammad Salih

Source

مجلة الرافدين لعلوم الحاسبات و الرياضيات : مجلة علمية محكمة و مفهرسة

Publisher

University of Mosul College of Computer Science and Mathematics

Publication Date

2010-11-30

Country of Publication

Iraq

No. of Pages

9

Main Subjects

Mathematics
Information Technology and Computer Science

Topics

• Operations research
• Mathematics
• Mathematical models
• Mathematical analysis
• Algorithms
• Simulation methods
• Parallel programming(Computer science)
• Computer software

Arabic Abstract

إيجاد أقل أو أكبر قيمة لدالة يكون على الأغلب مكلفا جدل، إذ أن حساب قيمة الدالة في نقطة ما يأخذ وقتا طويلا.

هدفنا في هذا العمل هو تطوير خوارزميات متوازية لإيجاد أقل أو أكبر قيمة للدوال التي تحتاج حساب قيمها وقت طويل، و أساس هذا التطوير هو إيجاد قيمة دالة الهدف في نقاط مختلفة في آن واحد.

English Abstract

Mostly minimization or maximization of a function is very expensive.

Since function evaluation of the objective function requires a considerable time.

Hence, our objective in this work is the development of parallel algorithms for minimization of objective functions evaluation takes long computing time.

The base of the developed parallel algorithms is the evaluation of the objective function at various points in same time (i.e.

simultaneously).

We consider in this work the parallelization of the direct search methods, as these methods are non-sensitive for noise and globally convergent.

We have developed two algorithms mainly they are dependent on the Hock and Jeff method in unconstrained optimization.

The developed parallel algorithm are suitable for running on MIMD machine which are consisting of several processors operating independently, each processor has its own memory and communicating with each other through a suitable network.

Data Type

Conference Papers

Record ID

BIM-277848

• APA
• MLA
• AMA