A family of parallel quasi-Newton algorithms for unconstrained minimization | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 90، دوره 12، شماره 1، مرداد 2021، صفحه 1123-1133 اصل مقاله (343.78 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2019.16979.1900 | ||
| نویسندگان | ||
| Abdel-Rahman Ahmed* ؛ Mohamed Salim | ||
| Department of Mathematics, Faculty of Science, Al-Azhar University (Assiut Branch), Assiut, Egypt | ||
| چکیده | ||
| This paper deals with the solution of the unconstrained optimization problems on parallel computers using quasi-Newton methods. The algorithm is based on that parallelism can be exploited in function and derivative evaluation costs and linear algebra calculations in the standard sequential algorithm. Computational problem is reported for showing that the parallel algorithm is superior to the sequential one. | ||
| کلیدواژهها | ||
| Parallel algorithm؛ Unconstrained optimization؛ Quasi-Newton | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 16,001 تعداد دریافت فایل اصل مقاله: 9,415 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 718 |
| تعداد مقالات | 10,319 |
| تعداد مشاهده مقاله | 72,323,695 |
| تعداد دریافت فایل اصل مقاله | 64,046,964 |