Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent

Conference paper

DOI: 10.1007/978-3-319-25040-3_50

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9389)
Cite this paper as:
Boumal N. (2015) Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent. In: Nielsen F., Barbaresco F. (eds) Geometric Science of Information. GSI 2015. Lecture Notes in Computer Science, vol 9389. Springer, Cham


The Riemannian trust-region algorithm (RTR) is designed to optimize differentiable cost functions on Riemannian manifolds. It proceeds by iteratively optimizing local models of the cost function. When these models are exact up to second order, RTR boasts a quadratic convergence rate to critical points. In practice, building such models requires computing the Riemannian Hessian, which may be challenging. A simple idea to alleviate this difficulty is to approximate the Hessian using finite differences of the gradient. Unfortunately, this is a nonlinear approximation, which breaks the known convergence results for RTR.

We propose RTR-FD: a modification of RTR which retains global convergence when the Hessian is approximated using finite differences. Importantly, RTR-FD reduces gracefully to RTR if a linear approximation is used. This algorithm is available in the Manopt toolbox.


RTR-FD Optimization on manifolds Convergence Manopt 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Inria & D.I., UMR 8548Ecole Normale SupérieureParisFrance

Personalised recommendations