| Home  | About ScienceAsia  | Publication charge  | Advertise with us  | Subscription for printed version  | Contact us  
Editorial Board
Journal Policy
Instructions for Authors
Online submission
Author Login
Reviewer Login
Volume 48 Number 6
Volume 48 Number 5
Volume 48 Number 4
Volume 48 Number 3
Volume 48 Number 2
Volume 48S Number 1
Earlier issues
Volume 41 Number 4 Volume 41 Number 5 Volume 41 Number 6

previous article next article

Research articles

ScienceAsia 41 (2015): 345-349 |doi: 10.2306/scienceasia1513-1874.2015.41.345

A new spectral Polak-Ribière-Polyak conjugate gradient method

Xuesha Wu

ABSTRACT:     By combining the spectral gradient and Polak-Ribière-Polyak (PRP) methods, a new spectral PRP conjugate gradient method is proposed to solve large-scaled unconstrained optimization problems. The method satisfies the famous conjugacy condition: dkTyk−1=0, independent of any line search. The direction at each iteration generated by the proposed method is downward for the general objective function without any line search. Under the standard Wolfe line search, we prove that the proposed method is globally convergent. Finally, the proposed method is compared with the PRP method and the scaled PRP method using a classical set of problems.

Download PDF

26 Downloads 1135 Views

College of General Education, Chongqing College of Electronic Engineering, Chongqing 401331 China

* Corresponding author, E-mail: wuxuesha2013@126.com

Received 29 Jan 2015, Accepted 2 Oct 2015