pith. sign in

arxiv: 1405.4371 · v3 · pith:AUQNMBEInew · submitted 2014-05-17 · 🧮 math.OC

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

classification 🧮 math.OC
keywords methodconditionsconjugategradientriemannianwolfealgorithmweak
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.