We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c(x, y) = |y-x|. The selected plan at the limit is, among those which are optimal for the nonpenalized problem, the most diffuse one on the zones where it may have a density.
The entropic regularization of the monge problem on the real line
Di Marino S.;
2018
Abstract
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c(x, y) = |y-x|. The selected plan at the limit is, among those which are optimal for the nonpenalized problem, the most diffuse one on the zones where it may have a density.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
monge1d_revised.pdf
accesso aperto
Tipologia:
Accepted version (post-print)
Licenza:
Creative Commons
Dimensione
531.47 kB
Formato
Adobe PDF
|
531.47 kB | Adobe PDF | |
|
17m1123523.pdf
Accesso chiuso
Tipologia:
Published version
Licenza:
Non pubblico
Dimensione
428.71 kB
Formato
Adobe PDF
|
428.71 kB | Adobe PDF | Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
