Answers are grounded in this paper and cite their sources.
Algorithmic analysis demonstrates Euclidean-level convergence rates and iteration complexity for non-monotone gradient methods on Riemannian manifolds, suggesting improved per-iteration efficiency.
This paper investigates gradient-type methods for solving optimization problems on Riemannian manifolds. In this approach, we utilize a search direction based on the gradient direction and employ a general non-monotone line search scheme to determine the stepsize at each iteration. This scheme encompasses several well-established non-monotone line search methods. Through our analysis, we demonstrate that this method exhibits asymptotic convergence characteristics and iteration-complexity bounds comparable to those of traditional Euclidean gradient-type methods using a non-monotone line search. The analysis presented significantly extends the study of gradient-type methods with line search to the domain of Riemannian manifolds, thereby providing several other line search options aiming at a better cost per iteration. Numerical experiments are also presented to illustrate the practical behavior of the proposed framework.
No takes yet. Share an insight, caveat, or question.
Ansari et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: