A new, globally convergent Riemannian conjugate gradient method

Abstract

This article deals with the conjugate gradient method on a Riemannian manifold with interest in global convergence analysis. The existing conjugate gradient algorithms on a manifold endowed with a vector transport need the assumption that the vector transport does not increase the norm of tangent vectors, in order to confirm that generated sequences have a global convergence property. In this article, the notion of a scaled vector transport is introduced to improve the algorithm so that the generated sequences may have a global convergence property under a relaxed assumption. In the proposed algorithm, the transported vector is rescaled in case its norm has increased during the transport. The global convergence is theoretically proved and numerically observed with examples. In fact, numerical experiments show that there exist minimization problems for which the existing algorithm generates divergent sequences, but the proposed algorithm generates convergent sequences.

22 pages, 8 figures

Cited by in corpus (6)

• A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
• Riemannian conjugate gradient methods: General framework and specific algorithms with convergence analyses
• New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
• Generalized Left-Localized Cayley Parametrization for Optimization with Orthogonality Constraints
• Riemannian Stochastic Variance-Reduced Cubic Regularized Newton Method for Submanifold Optimization
• A Riemannian Primal-dual Algorithm Based on Proximal Operator and its Application in Metric Learning