A note on the Bures-Wasserstein metric

arXiv2303.03883MaRDI QIDQ6428683FDOQ6428683

Authors: Shravan Mohan 

Publication date: 7 March 2023

Abstract: In this brief note, it is shown that the Bures-Wasserstein (BW) metric on the space positive definite matrices lends itself to convex optimization. In other words, the computation of the BW metric can be posed as a convex optimization problem. In turn, this leads to efficient computations of (i) the BW distance between convex subsets of positive definite matrices, (ii) the BW barycenter, and (iii) incorporating BW distance from a given matrix as a convex constraint. Computations are provided for corroboration.

This page was built for publication: A note on the Bures-Wasserstein metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428683)