We obtain analytical properties of the maps that give optimal transportation plans for the L 2 -Wasserstein distance. We take advantage of the monotonicity of such optimal transportation plans to discuss their measurability and continuity. As Ε½ a main result of independent interest we obtain the a.e
β¦ LIBER β¦
Monotonicity of the error of optimal segmented approximations
β Scribed by J. B. Kioustelidis
- Publisher
- Springer Vienna
- Year
- 1982
- Tongue
- English
- Weight
- 328 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the Monotonicity of Optimal Transport
β
J.A. Cuesta-Albertos; C. MatrΓ‘n; A. Tuero-DΔ±Μaz
π
Article
π
1997
π
Elsevier Science
π
English
β 196 KB
An Optimal Algorithm for the Straight Se
β
Y.M. Sharaiha; N. Christofides
π
Article
π
1993
π
Elsevier Science
β 842 KB
In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the
Monotonicity and the principle of optima
β
Thomas L Morin
π
Article
π
1982
π
Elsevier Science
π
English
β 535 KB
Approximation of the error function
β
W.R. Ernst
π
Article
π
1992
π
Elsevier Science
π
English
β 97 KB
Optimal approximation and error bounds i
β
Lois E Mansfield
π
Article
π
1972
π
Elsevier Science
π
English
β 991 KB
Simultaneous optimization of absolute an
β
Alex Bacopoulos
π
Article
π
1971
π
Elsevier Science
π
English
β 219 KB