中国科学A辑(英文版)
中國科學A輯(英文版)
중국과학A집(영문판)
SCIENCE IN CHINA
2003年
2期
251-261
,共11页
unconstrained optimization%conjugate gradient%line search%global convergence
Conjugate gradient methods are very important ones for solving nonlinear optimization problems,especially for large scale problems. However, unlike quasi-Newton methods, conjugate gradient methods wereusually analyzed individually. In this paper, we propose a class of conjugate gradient methods, which can beregarded as some kind of convex combination of the Fletcher-Reeves method and the method proposed byDai et al. To analyze this class of methods, we introduce some unified tools that concern a general methodwith the scalarβk having the form of φk/φk-1. Consequently, the class of conjugate gradient methods canuniformly be analyzed.
