![](/images/graphics-bg.png)
A new type of preconditioned CG-algorithm with exactly descent condition for solving non-linear unconstrained optimization
Other Title(s)
خوارزمية جديدة للتدرج المترافق المشروط مع شرط الانحدار التام في حل المسائل
Joint Authors
al-Bayati, Abbas Y.
Latif, Ivan S.
Source
Mu'tah Journal for Research and Studies : Natural and Applied Sciences Series
Issue
Vol. 22, Issue 3 (31 Dec. 2007), pp.71-90, 20 p.
Publisher
Mutah University Deanship of Academic Research
Publication Date
2007-12-31
Country of Publication
Jordan
No. of Pages
20
Main Subjects
Topics
Abstract AR
في هذا البحث تم اقتراح خوارزمية جديدة في مجال التدرج المترافق المشروط باستخدام خط بحث تام لحل المسائل اللاخطية في مجال الأمثلية غير المقيدة.
الخوارزمية تتحول إلى نوع من أنواع خوارزمية الانحدار المترافقة (Andrie, 2006) باستخدام المتري المتغير ذاتي القياس (Oren, 1974).
لقد تم كذلك برهان التقارب الشامل للخوارزمية المقترحة.
النتائج العملية باستخدام (26) دالة معروفة غير خطية، و بأبعاد أعطت نتائج مشجعة، و أثبتت كفاءة هذه الخوارزمية و سرعتها، مقارنة بمثيلاتها في هذا المجال.
Abstract EN
In this paper, a new PCG descent algorithm is proposed using an exact line search to solve a nonlinear unconstrained optimization problem.
The algorithm reduces to a version of the (Anderi N., 2006) conjugate descent algorithm and uses (Oren S.
S., 1974) self-scaling VM-algorithm to solve a large-scale unconstrained optimization problems.
The global convergence of the proposed algorithm has been proved.
Numerical experiments on twenty six well-known test functions with various dimensions are generally encouraging and show that the global convergence of the new proposed algorithm is faster and superior to other similar algorithms in this field.
American Psychological Association (APA)
al-Bayati, Abbas Y.& Latif, Ivan S.. 2007. A new type of preconditioned CG-algorithm with exactly descent condition for solving non-linear unconstrained optimization. Mu'tah Journal for Research and Studies : Natural and Applied Sciences Series،Vol. 22, no. 3, pp.71-90.
https://search.emarefa.net/detail/BIM-285228
Modern Language Association (MLA)
al-Bayati, Abbas Y.& Latif, Ivan S.. A new type of preconditioned CG-algorithm with exactly descent condition for solving non-linear unconstrained optimization. Mu'tah Journal for Research and Studies : Natural and Applied Sciences Series Vol. 22, no. 3 (2007), pp.71-90.
https://search.emarefa.net/detail/BIM-285228
American Medical Association (AMA)
al-Bayati, Abbas Y.& Latif, Ivan S.. A new type of preconditioned CG-algorithm with exactly descent condition for solving non-linear unconstrained optimization. Mu'tah Journal for Research and Studies : Natural and Applied Sciences Series. 2007. Vol. 22, no. 3, pp.71-90.
https://search.emarefa.net/detail/BIM-285228
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 88-90
Record ID
BIM-285228