A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices
Not on the map. Why?
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 17 Dec 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.