Quadratic optimal transportation problem with a positive semi definite structure on the cost function
Abstract: Optimal transportation problem seeks for a coupling $\pi$ of two probability measures $\mu$ and $\nu$ which minimize the total cost $\int c d\pi$, which is linear in $\pi$. In this paper, we introduce a variation of optimal transportation problem which we call quadratic transportation problem that considers a total cost $\iint c d\pi d\pi$ which is quadratic in $\pi$. 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 $\iint c d\pi d\pi$ as a positive semi-definite bilinear operator on probability measures, and show Kantorovich duality formula when we have a squared cost function.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.