It is connected to the settings of conic formulations introduced in Section REF , see Definition REF .
In practice one takes \((t)=t^2\)  for computational purposes [1]}.
Theorem REF  below states that the formulation \(\)  is definite.
We then leverage entropic regularization to derive a Sinkhorn-like algorithm.
An important modification from [2]}, [1]} is that we use a regularization \(\epsilon ^\otimes \)  instead of \(\epsilon \) .
