A Riemannian Limited-Memory BFGS Algorithm for Computing the Matrix Geometric Mean
Authors:
- Xinru YuanXYXinru Yuan
- Wen HuangWHWen Huang
- P.-A. AbsilPAP.-A. Absil
- K.A. GallivanKGK.A. Gallivan
Open Access
- 1 January 2016
- journal article
- Published by Elsevier in Procedia Computer Science
- Vol. 80, 2147-2157
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A Riemannian symmetric rank-one trust-region methodMathematical Programming, 2014
- Computing the Karcher mean of symmetric positive definite matricesLinear Algebra and its Applications, 2013
- On the Convergence of Gradient Descent for Finding the Riemannian Center of MassSIAM Journal on Control and Optimization, 2013
- Efficient Recursive Algorithms for Computing the Mean Diffusion Tensor and Applications to DTI Segmentation2012
- Monotonicity of the matrix geometric meanMathematische Annalen, 2011
- Optimization Algorithms on Matrix Manifolds2008
- Innovative tools for radar signal processing Based on Cartan’s geometry of SPD matrices & Information Geometry2008
- Riemannian geometry for the statistical analysis of diffusion tensor dataSignal Processing, 2007
- Geometric meansLinear Algebra and its Applications, 2004
- Principal Geodesic Analysis on Symmetric Spaces: Statistics of Diffusion Tensors2004