Volume 39, pp. 379-402, 2012.

A survey and comparison of contemporary algorithms for computing the matrix geometric mean

Ben Jeuris, Raf Vandebril, and Bart Vandereycken


In this paper we present a survey of various algorithms for computing matrix geometric means and derive new second-order optimization algorithms to compute the Karcher mean. These new algorithms are constructed using the standard definition of the Riemannian Hessian. The survey includes the ALM list of desired properties for a geometric mean, the analytical expression for the mean of two matrices, algorithms based on the centroid computation in Euclidean (flat) space, and Riemannian optimization techniques to compute the Karcher mean (preceded by a short introduction into differential geometry). A change of metric is considered in the optimization techniques to reduce the complexity of the structures used in these algorithms. Numerical experiments are presented to compare the existing and the newly developed algorithms. We conclude that currently first-order algorithms are best suited for this optimization problem as the size and/or number of the matrices increase.

Full Text (PDF) [399 KB], BibTeX

Key words

matrix geometric mean, positive definite matrices, Karcher mean, Riemannian optimization

AMS subject classifications

15A24, 53B21, 65K10

Links to the cited ETNA articles

< Back