首页> 外文会议>International Conference on Computing and Information Science and Technology and Their Applications >A New Class of Nonlinear Conjugate Gradient Method for Solving Unconstrained Minimization Problems
【24h】

A New Class of Nonlinear Conjugate Gradient Method for Solving Unconstrained Minimization Problems

机译:求解无约束最小化问题的一类新型非线性共轭梯度法

获取原文

摘要

Formulas of new “nonlinear conjugate gradient (CG)”, satisfying “the sufficient descent condition”, are proposed to solve problems of unconstrained optimization. Wolfe line search was employed to establish the global convergence of the new algorithm proposed in this study. The implementation of a numerical comparison against the well-known method of FR and its variant denotes practical insights into the effectiveness of proposed algorithms.
机译:提出了满足“充分下降条件”的新的“非线性共轭梯度(CG)”公式,以解决无约束优化问题。利用Wolfe线搜索来建立本研究中提出的新算法的全局收敛性。与著名的FR方法及其变体进行数值比较的实现表明对所提出算法的有效性有实际见解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号