arXiv Analytics

Sign in

arXiv:1812.00032 [math.OC]AbstractReferencesReviewsResources

Optimal Transport on the Probability Simplex with Logarithmic Cost

Gabriel Khan, Jun Zhang

Published 2018-11-30Version 1

Motivated by the financial problem of building financial portfolios which outperform the market, Pal and Wong considered optimal transport on the probability simplex $\triangle^n$ where the cost function is induced by the free energy. We study the regularity of this problem and find that the associated $MTW$ tensor is non-negative definite and in fact constant on $\triangle^n \times \triangle^n$. We further find that relative $c$-convexity corresponds to the standard notion of convexity in the probability simplex. Hence, we are able to use standard results in optimal transport to establish regularity for the optimal transport maps considered by Pal and Wong. We also provide several new examples of costs satisfying the $MTW(0)$ condition.

Related articles: Most relevant | Search more
arXiv:2405.16006 [math.OC] (Published 2024-05-25)
Multifractal Analysis of the Sinkhorn Algorithm: Unveiling the Intricate Structure of Optimal Transport Maps
arXiv:2105.08653 [math.OC] (Published 2021-05-18, updated 2022-04-25)
Minimal angle spread in the probability simplex with respect to the uniform distribution
arXiv:2305.09046 [math.OC] (Published 2023-05-15)
Convex optimization over a probability simplex