ویراساینس.
مقاله

A spectral Conjugate Gradient method for solving unconstrained optimization problems

Mariya Toofan, Gohar Shakouri

چکیده

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.

شکل‌ها (۲)

  • Figure 1: Outputs of comparisons by the approximate Wolfe line search with respect to TNFGE
    Figure 1: Outputs of comparisons by the approximate Wolfe line search with respect to TNFGEصفحه‌ی ۶
  • Figure 2: Outputs of comparisons by the approximate Wolfe line search with respect to CPUT
    Figure 2: Outputs of comparisons by the approximate Wolfe line search with respect to CPUTصفحه‌ی ۶

شکل‌ها از متن کامل مقاله برداشته شده‌اند و حقوقشان از آنِ نویسندگان و ناشر است. منبع: صفحه‌ی اصلی مقاله

اسناد مشابه