مشخصات پژوهش

عنوان	A q-Polak–Ribiere–Polyak conjugate gradient algorithm for unconstrained optimization problems
نوع پژوهش	مقاله چاپ‌شده در مجلات علمی
کلیدواژه‌ها	Unconstrained optimization; Conjugate gradient method; Global convergence; q-calculus
چکیده	A Polak–Ribière–Polyak (PRP) algorithm is one of the oldest and popular conjugate gradient algorithms for solving nonlinear unconstrained optimization problems. In this paper, we present a q-variant of the PRP (q-PRP) method for which both the sufficient and conjugacy conditions are satisfied at every iteration. The proposed method is convergent globally with standard Wolfe conditions and strong Wolfe conditions. The numerical results show that the proposed method is promising for a set of given test problems with different starting points. Moreover, the method reduces to the classical PRP method as the parameter q approaches 1.
پژوهشگران	شاشی کنت میشرا (نفر اول)، سورا منتی چاکرابورتی (نفر دوم)، محمداسماعیل سامعی (نفر سوم)، باهاگوات رام (نفر چهارم)