An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with O({Dim(P)}/\varepsilon) Computational Complexity

MaRDI QIDQ7147928arXivFDO

Authors Guojun Zhang, Yancheng Yuan, Defeng Sun

Publication date 2022

Published in arXiv

arXiv classification

math.OC

This page was built for publication: An Efficient HPR Algorithm for the Wasserstein Barycenter Problem with $O({Dim(P)}/\varepsilon)$ Computational Complexity

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