New Computable Necessary Conditions for the Regularity Theory of Optimal Transportation
Paul W.Y. Lee
TL;DR
This paper introduces new computable necessary conditions that determine when solutions to certain optimal transportation problems are smooth, aiding in understanding the regularity of these solutions.
Contribution
It provides novel, explicitly computable necessary conditions for the regularity of solutions in a specific class of optimal transportation problems.
Findings
New necessary conditions for smooth solutions
Conditions are explicitly computable
Applicable to a class of optimal transportation problems
Abstract
We give new computable necessary conditions for a class of optimal transportation problems to have smooth solutions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Nonlinear Partial Differential Equations · Optimization and Variational Analysis