Sinkhorn's Algorithm

From Optimal Transport Wiki

Revision as of 06:55, 9 May 2020 by Cbueno (talk | contribs) (Created page with "Sinkhorn's Algorithm is an iterative numerical method used to obtain an optimal transport plan <math> \pi\in\gamma(\mu,\nu) </math> for the Kantorovich problem with entr...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Sinkhorn's Algorithm is an iterative numerical method used to obtain an optimal transport plan $\pi \in \gamma (\mu ,\nu )$ for the Kantorovich problem with entropic regularization in the case of finitely supported measures $\mu$ and $\nu$ .

Problem Formulation

Intuition

Sinkhorn's Algorithm

Retrieved from "http://www.otwiki.xyz/index.php?title=Sinkhorn%27s_Algorithm&oldid=265"