A new modification of nonlinear conjugate gradient formula
Nonlinear conjugate gradient (CG) methods are widely used for solving large-scale unconstrained optimization problems. Many works have tried to improve this method. It requires simplicity and low memory in numerical computation. The exact line search is used for analyzing and implementing CG methods...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Pushpa Publishing House
2016
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://eprints.unisza.edu.my/7478/1/FH02-FIK-16-06144.jpg http://eprints.unisza.edu.my/7478/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Nonlinear conjugate gradient (CG) methods are widely used for solving large-scale unconstrained optimization problems. Many works have tried to improve this method. It requires simplicity and low memory in numerical computation. The exact line search is used for analyzing and implementing CG methods. In this paper, a class of conjugate gradient methods possessing global convergence properties is presented. The global convergence and sufficient descent property are established using exact line searches. Numerical result demonstrated that the new formula of conjugate gradient method is superior and robust as compared to other CG coefficients. |
|---|