An improved Polak-Ribiere-Polyak method using strong wolfe-powell line search for unconstrained optimization problems
The unconstrained optimization problem has been dealing with different methods to be solved recently. The most common solution is the conjugate gradient (CG) method due to its convergence speed, simplicity, low memory requirements, and its capability to solve large-scale problems. There are many mod...
محفوظ في:
المؤلف الرئيسي: | Mahmoud Irsheid Dawahdeh (مؤلف) |
---|---|
مؤلفون آخرون: | x |
التنسيق: | أطروحة كتاب |
اللغة: | English |
الموضوعات: | |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Hybrid methods of Polak-Ribiere-Polyak, Wei-Yao-Liu and Polak-Ribiere-Polyak, Dai-Wen methods for unconstrained optimization problems
بواسطة: Yasir Salih Mohammednour Mhmoud -
Modified spectral conjugate gradient methods for unconstrained optimization and system of linear equations
بواسطة: Wan Khadijah binti Wan Sulaiman -
Performance analysis of SRM family for unconstrained optimization problems
بواسطة: Syazni Shoid -
Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
بواسطة: Leong, Wah June
منشور في: (2003) -
Interval estimates based on local linearization in a nonlinear model /
بواسطة: Khoo, Kim Chiew
منشور في: (1990)