Research articles
ScienceAsia 40 (2014): 295-300 |doi:
10.2306/scienceasia1513-1874.2014.40.295
New three-term conjugate gradient method for solving unconstrained optimization problems
Jinkui Liua,*, Xuesha Wub
ABSTRACT: Based on the Davidson-Fletcher-Powell (DFP) method which is a quasi-Newton method, an effective three-term conjugate gradient method is constructed to solve large-scale unconstrained optimization problems. The method possesses two attractive properties: (i) the famous Dai-Liao conjugate condition is satisfied and is independent of any line search; (ii) the sufficient descent property always holds without any line search. The convergence analysis is established under the general Wolfe line search. Numerical results show that the new method is effective and robust by comparing with the SPRP, PRP, and CG-DESCENT methods for the given test problems.
Download PDF
10 Downloads 1395 Views
| a |
Key Laboratory for Nonlinear Science and System Structure, Chongqing Three Gorges University, Wanzhou 404100 China |
| b |
College of General Education, Chongqing College of Electronic Engineering, Chongqing 401331 China |
* Corresponding author, E-mail: liujinkui2006@126.com
Received 14 Jan 2013, Accepted 23 Mar 2014
|
