Existence of optimal transport maps for crystalline norms (Q1766221)

From MaRDI portal
Revision as of 18:11, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Existence of optimal transport maps for crystalline norms
scientific article

    Statements

    Existence of optimal transport maps for crystalline norms (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2005
    0 references
    The \textit{optimal transport problem} (posed by G. Monge in 1781) consists in transporting a given distribution of matter (for instance, a pile of sand) from one place to another minimizing the cost of transportation. If \(\mu, \nu\) are probability measures describing the initial and final distributions, the cost is \[ \int_{R^n} c(x, t(x)) \mu(dx) \] where \(c(x, y)\) is the cost of transporting a unit mass from \(x\) to \(y\) and \(t\) is a \textit{transport} (a Borel map \(t : R^n \to R^n\) such that \(\mu(t^{-1}(e)) = \nu(e)\) for every Borel set \(e).\) The Monge problem was brought back to life by L. V. Kantorovich in 1942, who, among many other things, introduced the notion of weak (measure-valued) solution. Interest on the Monge-Kantorovich problem has sharply increased in the last two decades. As the authors point out, existence of optimal transports when \(c(x, y) = h(y - x)\) depends on the strict convexity of \(h,\) thus even the function originally used by Monge \(h(x) = | x| \) (Euclidean norm) is left out. This paper presents an existence proof for \textit{crystalline norms;} these are given by \[ \| u\| = \max\{ | u\cdot v_i| \, ; \;i = 1, \dots, n\} \, , \] for vectors \(v_1, \dots, v_n\) spanning \(R^n.\)
    0 references
    semicontinuity
    0 references
    relaxation
    0 references
    disintegration of measures
    0 references
    Monge-Kantorovich problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers