Averaging Symmetric Positive-Definite Matrices
DOI10.1007/978-3-030-31351-7_20OpenAlexW3014708875MaRDI QIDQ3300555
Xinru Yuan, Kyle A. Gallivan, Wen Huang, Pierre-Antoine Absil
Publication date: 29 July 2020
Published in: Handbook of Variational Methods for Nonlinear Geometric Data (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-31351-7_20
Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65Mxx) Numerical methods for partial differential equations, boundary value problems (65Nxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fixed-point approach to barycenters in Wasserstein space
- Log-determinant divergences revisited: alpha-beta and gamma log-det divergences
- Monotonicity of the matrix geometric mean
- Monotonic properties of the least squares mean
- On approximating the Riemannian 1-center
- Breakdown points of affine equivariant estimators of multivariate location and covariance matrices
- Riemannian geometry and matrix geometric means
- Riemannian geometry for the statistical analysis of diffusion tensor data
- Wasserstein Riemannian geometry of Gaussian densities
- Diagonality measures of Hermitian positive-definite matrices with application to the approximate joint diagonalization problem
- Rate-invariant analysis of covariance trajectories
- Geometric means
- Computing the Karcher mean of symmetric positive definite matrices
- Matrix geometric means based on shuffled inductive sequences
- On the Bures-Wasserstein distance between positive definite matrices
- Means of Hermitian positive-definite matrices based on the log-determinant \(\alpha\)-divergence function
- A survey and comparison of contemporary algorithms for computing the matrix geometric mean
- Optimal core-sets for balls
- On the averaging of symmetric positive-definite tensors
- A Riemannian framework for tensor computing
- Positive definite matrices and the S-divergence
- Coordinate Coding on the Riemannian Manifold of Symmetric Positive-Definite Matrices for Image Classification
- On the Convergence of Gradient Descent for Finding the Riemannian Center of Mass
- Quantum Computation and Quantum Information
- Riemannian $L^{p}$ center of mass: Existence, uniqueness, and convexity
- Barycenters in the Wasserstein Space
- Differentiable Piecewise-Bézier Surfaces on Riemannian Manifolds
- Matrix Nearness Problems with Bregman Divergences
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- The Geometric Mean, Matrices, Metrics, and More
- ON THE CURVATURE OF A CERTAIN RIEMANNIAN SPACE OF MATRICES
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
- Divergence Function, Duality, and Convex Analysis
- STRUCTURE TENSOR IMAGE FILTERING USING RIEMANNIAN L1 AND L∞ CENTER-OF-MASS
- Quotient Geometry with Simple Geodesics for the Manifold of Fixed-Rank Positive-Semidefinite Matrices
- Riemannian Gaussian Distributions on the Space of Symmetric Positive Definite Matrices
- A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices
- Using the Bhattacharyya Mean for the Filtering and Clustering of Positive-Definite Matrices
This page was built for publication: Averaging Symmetric Positive-Definite Matrices