|
A spectral Conjugate Gradient method for solving unconstrained optimization problems
|
| |
|
|
|
چکیده: (30 مشاهده) |
The conjugate gradient method (CGM) stands out as one of the most rapidly growing and effective approaches for addressing unconstrained optimization problems. In recent years, significant efforts have been dedicated to adapting the CGM for tackling nonlinear optimization challenges. This research article introduces a new modification of the Fletcher–Reeves (FR) conjugate gradient projection method. The proposed method is characterized by its sufficient descent property, and its global convergence has been established under specific assumptions. Numerical experiments conducted on a range of functions from the CUTEr collection demonstrate the potential and effectiveness of the proposed methods.
|
|
| |
|
|
متن کامل [PDF 713 kb]
(6 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Continuous Optimization
دریافت: 1404/7/8 | پذیرش: 1404/10/10 | انتشار: 1404/10/10
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
