|
|
|
|
a family of parallel quasi-newton algorithms for unconstrained minimization
|
|
|
|
|
|
|
|
نویسنده
|
salim m. s. ,ahmed a.l.
|
|
منبع
|
international journal of nonlinear analysis and applications - 2021 - دوره : 12 - شماره : 1 - صفحه:1123 -1133
|
|
چکیده
|
This paper deals with the solution of unconstrained optimization problems on parallel computers using quasi-newton methods. the algorithm is based on exploiting parallelism in function and derivative evaluation costs and linear algebra calculations in the standard sequential algorithm. a computational problem is reported for showing that the parallel algorithm is superior to the sequential one.
|
|
کلیدواژه
|
parallel algorithm ,unconstrained optimization ,quasi-newton
|
|
آدرس
|
al-azhar university, faculty of science, department of mathematics, egypt, al-azhar university, faculty of science, department of mathematics, egypt
|
|
پست الکترونیکی
|
ab1_ibrahim@yahoo.com; aiahmed@azhar.edu.eg
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|