In this paper, a Riemannian BFGS method is defined for minimizing a smooth function on a Riemannian manifold endowed with a retraction and a vector transport. The method is based on a Riemannian generalization of a cautious update and a weak line search condition. It is shown that, the Riemannian BFGS method converges (i) globally to a stationary point without assuming that the objective function is convex and (ii) superlinearly to a nondegenerate minimizer. The weak line search condition removes completely the need to consider the differentiated retraction. The joint diagonalization problem is used to demonstrate the performance of the algorithm with various parameters, line search conditions, and pairs of retraction and vector transport.
CITATION STYLE
Huang, W., Absil, P. A., & Gallivan, K. A. (2016). A Riemannian BFGS method for nonconvex optimization problems. In Lecture Notes in Computational Science and Engineering (Vol. 112, pp. 627–634). Springer Verlag. https://doi.org/10.1007/978-3-319-39929-4_60
Mendeley helps you to discover research relevant for your work.