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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | أطروحة كتاب |
| اللغة: | English |
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
جدول المحتويات:
- 1. Introduction and research overview
- 2. Basic concepts of unconstrained optimization
- 3. Conjugate gradient method and numerical performance
- 4. Improved methods of polak-ribiere-polyak
- 5. Application in regression analysis
- 6. Conclusion and future research