Answers are grounded in this paper and cite their sources.
In this paper, the composite optimization problem is studied on Riemannian manifolds. To tackle this problem, the proximal gradient method to solve composite optimization problems is proposed on Riemannian manifolds. Under some reasonable conditions, the convergence of the proximal gradient method with the backtracking procedure in the nonconvex case is presented. Furthermore, a sublinear convergence rate and the complexity result of the proximal gradient method for convex case are also established on Riemannian manifolds.
No takes yet. Share an insight, caveat, or question.
Xiaobo Li (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: