New three-term conjugate gradient method for solving unconstrained optimization problems

اسناد مشابه

• A scaled three-term conjugate gradient method for unconstrained optimization

  مقاله‌ی دسترسی آزاد۲۰۱۶Journal of Inequalities and ApplicationsIbrahimArzuka, Mohd RAbu Bakar, Wah JuneLeong

• A Conjugate Gradient Method for Unconstrained Optimization Problems

  سند علمی۲۰۰۹Int. J. Math. Mathematical SciencesGonglin Yuan

  A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell SWP line search rule relaxing the par

• A simple three-term conjugate gradient algorithm for unconstrained optimization

  مقاله‌ی دسترسی آزاد۲۰۱۳Journal of Computational and Applied MathematicsNeculaiAndrei

• A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems

  مقاله‌ی دسترسی آزاد۲۰۱۸AlgorithmsXiuyunZheng, JiarongShi

• A new Liu–Storey type nonlinear conjugate gradient method for unconstrained optimization problems

  مقاله‌ی دسترسی آزاد۲۰۰۹Journal of Computational and Applied MathematicsLiZhang

• A New conjugate gradient method for unconstrained optimization problems with descent property

  مقاله‌ی دسترسی آزاد۲۰۲۰General Letters in MathematicsHusseinAgeel Khatab, SalahGazi Shareef