Conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
This thesis focuses on solving conjugate gradient methods for large-scale uncon- strained optimization problems. The main objective of this study is to propose some modifications to the standard conjugate gradient methods so that its search direction satisfies the sufficient descent and the bo...
محفوظ في:
المؤلف الرئيسي: | Ling, Mei Mei |
---|---|
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2015
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/85444/1/FS%202016%2091%20ir.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Scaled three-term conjugate gradient method via Davidon-Fletcher-Powell update for unconstrained optimization
بواسطة: Ibrahim, Arzuka
منشور في: (2015) -
Multiple Alternate Steps Gradient Methods For Unconstrained Optimization
بواسطة: Lee, Sui Fong
منشور في: (2009) -
New conjugate gradient methods for solving large-scale unconstrained optimization problems
بواسطة: Mohd Rivaie Mohd Ali -
Modified quasi-Newton type methods using gradient flow system for solving unconstrained optimization
بواسطة: Yap, Chui Ying
منشور في: (2016) -
Some modifications of conjugate gradient coefficient for unconstrained optimization
بواسطة: Mohd Rivaie Mohd Ali