A Remark on the Potentials of Optimal Transport Maps
classification
🧮 math.DG
math.DS
keywords
optimalc-convexmapsactioncompletelyconditionscorrespondingcost
read the original abstract
Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the cost is given by minimizing a Lagrangian action.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.