Parallel Direct Search Methods
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 t...
Main Authors: | Bashir Khalaf, Mohammed Al-Neama |
---|---|
Format: | Article |
Language: | Arabic |
Published: |
Mosul University
2010-12-01
|
Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
Subjects: | |
Online Access: | https://csmj.mosuljournals.com/article_163909_ca812f96cff47b152cc0ecf848847b24.pdf |
Similar Items
-
A New Optimization Idea: Parallel Search-Based Golden Jackal Algorithm
by: Bin Wang, et al.
Published: (2023-01-01) -
Methods for Parallelizing Search Paths in Phrasing
by: Marcken, Carl de
Published: (2004) -
Survey of Parallel Block Methods
by: Bashir M. Khalaf, et al.
Published: (2010-09-01) -
Modification of the Armijo line search to satisfy the convergence properties of HS method
by: Mohammed Belloufi, et al.
Published: (2013-07-01) -
A randomized adaptive trust region line search method
by: Saman Babaie-Kafaki, et al.
Published: (2020-07-01)