# A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices

arXiv: https://arxiv.org/abs/1312.4654 · HTML: https://mlsanity.com/paper/1312.4654/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Dec 2013.

## Built on by (most cited first, 1 of 1)

- [mSPD-NN: A Geometrically Aware Neural Framework for Biomarker Discovery from Functional Connectomics Manifolds](https://mlsanity.com/paper/2303.14986/) (2023)

## Abstract (arXiv)

An algorithm for computing the Karcher mean of n positive definite matrices is proposed, based on the majorization-minimization (MM) principle. The proposed MM algorithm is parameter-free, does not need to choose step sizes, and has a theoretical guarantee of asymptotic linear convergence.