An Accelerated Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition |
| |
Authors: | XiaoLiang Dong Deren Han Zhifeng Dai Lixiang Li Jianguang Zhu |
| |
Affiliation: | 1.School of Mathematics and Information,North Minzu University,Yinchuan,People’s Republic of China;2.School of Mathematics and System Science,Beihang University,Beijing,People’s Republic of China;3.College of Mathematics and statistics,Changsha University of Science and Technology,Changsha,People’s Republic of China;4.School of Mathematics and Computing Science,Guilin University of Electronic Technology,Guilin,People’s Republic of China;5.College of Mathematics and System Science,Shandong University of Science and Technology,Qindao,People’s Republic of China |
| |
Abstract: | An accelerated three-term conjugate gradient method is proposed, in which the search direction can satisfy the sufficient descent condition as well as extended Dai–Liao conjugacy condition. Different from the existent methods, a dynamical compensation strategy in our proposed method is considered, that is Li–Fushikuma-type quasi-Newton equation is satisfied as much as possible, otherwise, to some extent, the singular values of iteration matrix of search directions will adaptively clustered, which substantially benefits acceleration the convergence or reduction in the condition number of iteration matrix. Global convergence is established under mild conditions for general objective functions. We also report some numerical results to show its efficiency. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|