Broyden–Fletcher–Goldfarb–Shanno算法
行搜索
共轭梯度法
选择(遗传算法)
数学优化
趋同(经济学)
梯度下降
算法
非线性共轭梯度法
计算机科学
下降(航空)
文件夹
数学
人工智能
人工神经网络
航空航天工程
计算机网络
异步通信
计算机安全
金融经济学
经济增长
工程类
半径
经济
作者
Auwal Bala Abubakar,Poom Kumam,Maulana Malik,Parin Chaipunya,Abdulkarim Hassan Ibrahim
出处
期刊:AIMS mathematics
[American Institute of Mathematical Sciences]
日期:2021-01-01
卷期号:6 (6): 6506-6527
被引量:34
摘要
In this paper, we present a new hybrid conjugate gradient (CG) approach for solving unconstrained optimization problem. The search direction is a hybrid form of the Fletcher-Reeves (FR) and the Dai-Yuan (DY) CG parameters and is close to the direction of the memoryless Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton approach. Independent of the line search, the search direction of the new approach satisfies the descent condition and possess the trust region. We establish the global convergence of the approach for general functions under the Wolfe-type and Armijo-type line search. Using the CUTEr library, numerical results show that the propose approach is more efficient than some existing approaches. Furthermore, we give a practical application of the new approach in optimizing risk in portfolio selection.
科研通智能强力驱动
Strongly Powered by AbleSci AI