Quadratic optimal transportation problem with a positive semi definite structure on the cost function
Abstract
Optimal transportation problem seeks for a coupling π of two probability measures μ and which minimize the total cost ∫ c dπ, which is linear in π. In this paper, we introduce a variation of optimal transportation problem which we call quadratic transportation problem that considers a total cost c dπ dπ which is quadratic in π. We compare this problem with other variations of optimal transportation problem, and prove some properties of the solutions to the problem. Then, we introduce squared cost function, which let us consider the total cost c dπ dπ as a positive semi-definite bilinear operator on probability measures, and show Kantorovich duality formula when we have a squared cost function.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.