A combination of FR and HS coefficient in conjugate gradient method for unconstrained optimization
The conjugate gradient (CG) method is one of the most popular methods for solving large-scale problems of unconstrained optimization. In this paper, a new CG method based on combination of two classical CG methods of Fletcher-Reeves (FR), and Hestence-Stiefel (HS) is proposed. This method possess...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
2019
|
| 主題: | |
| オンライン･アクセス: | http://eprints.unisza.edu.my/6753/1/FH02-FIK-20-47982.pdf http://eprints.unisza.edu.my/6753/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | The conjugate gradient (CG) method is one of the most popular methods for solving large-scale problems
of unconstrained optimization. In this paper, a new CG method based on combination of two classical CG
methods of Fletcher-Reeves (FR), and Hestence-Stiefel (HS) is proposed. This method possess the
global convergence properties and the sufficient descent condition. The tests of the new CG method by
using MATLAB are measured in terms of central processing unit (CPU) time and iteration numbers with
strong Wolfe-Powell inexact line search. Results presented have shown that the new CG method
performs better compare to other CG methods. |
|---|