A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions

Abstract

This article describes a new Riemannian conjugate gradient method and presents a global convergence analysis. The existing Fletcher-Reeves-type Riemannian conjugate gradient method is guaranteed to be globally convergent if it is implemented with the strong Wolfe conditions. On the other hand, the Dai-Yuan-type Euclidean conjugate gradient method generates globally convergent sequences under the weak Wolfe conditions. This article deals with a generalization of Dai-Yuan's Euclidean algorithm to a Riemannian algorithm that requires only the weak Wolfe conditions. The global convergence property of the proposed method is proved by means of the scaled vector transport associated with the differentiated retraction. The results of numerical experiments demonstrate the effectiveness of the proposed algorithm.

16 pages

References in corpus (1)

• A new, globally convergent Riemannian conjugate gradient method

Cited by in corpus (10)

• Global rates of convergence for nonconvex optimization on manifolds
• Riemannian conjugate gradient methods: General framework and specific algorithms with convergence analyses
• Decentralized Optimization Over the Stiefel Manifold by an Approximate Augmented Lagrangian Function
• A Communication-Efficient and Privacy-Aware Distributed Algorithm for Sparse PCA
• New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
• Solving Optimization Problems over the Stiefel Manifold by Smooth Exact Penalty Function
• Riemannian optimal identification method for linear systems with symmetric positive-definite matrix
• Sufficient Descent Riemannian Conjugate Gradient Method
• Hybrid Riemannian Conjugate Gradient Methods with Global Convergence Properties
• Numerical solution of Lyapunov equations related to Markov jump linear systems