<p>In 2006, the first spectral Fletcher–Reeves conjugate gradient (CG) parameter was introduced, accompanied by a convergence analysis based on the exact line search procedure. To avoid the need for an exact line search, this paper introduces a generalized spectral CG parameter based on a revised Fletcher–Reeves spectral (rFRS) approach in Riemannian optimization. The proposed parameter ensures the sufficient descent property without requiring a line search. Global convergence is demonstrated under mild assumptions. Numerical experiments show that the proposed scheme outperforms existing Riemannian CG methods in terms of efficiency. It also demonstrates robust performance across five different Riemannian optimization problems. Furthermore, the rFRS method demonstrates efficient results in solving inverse problems associated with the Gough–Stewart platform.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Spectral conjugate gradient for Riemannian optimization: application to the Gough–Stewart platform

  • Salihu Nasiru,
  • Poom Kumam,
  • Sani Salisu,
  • Lin Wang,
  • Thidaporn Seangwattana

摘要

In 2006, the first spectral Fletcher–Reeves conjugate gradient (CG) parameter was introduced, accompanied by a convergence analysis based on the exact line search procedure. To avoid the need for an exact line search, this paper introduces a generalized spectral CG parameter based on a revised Fletcher–Reeves spectral (rFRS) approach in Riemannian optimization. The proposed parameter ensures the sufficient descent property without requiring a line search. Global convergence is demonstrated under mild assumptions. Numerical experiments show that the proposed scheme outperforms existing Riemannian CG methods in terms of efficiency. It also demonstrates robust performance across five different Riemannian optimization problems. Furthermore, the rFRS method demonstrates efficient results in solving inverse problems associated with the Gough–Stewart platform.