We detail the pseudo-code to implement the results of Proposition REF  in Algorithm REF .
Note that it reuses Sinkhorn Algorithm REF .
Since UGW is a non-convex problem, the limit of the algorithm depends on the initialization. An efficient initialization strategy is to use the solutions of lower bounds of GW as detailed in [1]}.
