Abstract
The problem of transporting graphs of continuous maps in a metric space with minimal cost is formulated. The minimal cost distance generated by this problem in the space of continuous maps is studied. The topology induced by this distance will be studied. A measure-theoretical version of the minimal cost distance will be given.
| Original language | English |
|---|---|
| Article number | 23 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 204 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2025 |
Keywords
- Mapping
- Metric space
- Optimal transport
Fingerprint
Dive into the research topics of 'Optimal Transport of Maps'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver