A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices
From MaRDI portal
Publication:5346759
DOI10.1137/15M1024482zbMath1365.65118arXiv1312.4654OpenAlexW2964135324MaRDI QIDQ5346759
Publication date: 29 May 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.4654
Related Items
Riemannian optimization via Frank-Wolfe methods ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ Averaging Symmetric Positive-Definite Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Norms and exclusion theorems
- Riemannian geometry for the statistical analysis of diffusion tensor data
- Introductory lectures on convex optimization. A basic course.
- Geometric means
- Newton's method, zeroes of vector fields, and the Riemannian center of mass
- Computing the Karcher mean of symmetric positive definite matrices
- A survey and comparison of contemporary algorithms for computing the matrix geometric mean
- Geometric means of structured matrices
- Positive definite matrices
- A Riemannian framework for tensor computing
- On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Iteratively reweighted least squares minimization for sparse recovery
- Medians and Means in Riemannian Geometry: Existence, Uniqueness and Computation
- Functions of Matrices
- A note on Fermat's problem
- Convex functions and their applications. A contemporary approach
This page was built for publication: A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices
