数学
共轭梯度法
期限(时间)
结合
非线性共轭梯度法
数学优化
应用数学
梯度下降
计算机科学
人工智能
数学分析
人工神经网络
物理
量子力学
标识
DOI:10.1080/10556788.2024.2329591
摘要
Based on several modified Hestenes–Stiefel and Polak–Ribière–Polyak nonlinear conjugate gradient methods, a family of three term limited memory CG methods are developed. When the current search direction falls into the subspace spanned by the previous m directions, the algorithm branches to optimize the objective function on the subspace by using L-BFGS method. We use this strategy to avoid potential local loops and accelerate the convergence. The proposed methods are sufficient descent. When the steplength is determined by Wolfe or Armijo line search, we establish the global convergence of the methods in a concise way. Numerical results verify the efficiency of the proposed method for the unconstrained optimization problems in the CUTEst library.
科研通智能强力驱动
Strongly Powered by AbleSci AI