OurBigBook About$ Donate
 Sign in Sign up

Transport potential path construction

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Optimal transport c-cyclical monotonicity Strong c-monotonicity
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Anchor a countable dense subset of a closed c-cyclically monotone support. Take the infimum of accumulated differences c(xj+1​,yj​)−c(xj​,yj​) along chains ending at a variable point. Cyclical monotonicity bounds this potential below on the support projection. Its cost transform gives the other potential, with equality on the support. Continuity makes both potentials upper semicontinuous and thus Borel.

 Ancestors (7)

  1. Strong c-monotonicity
  2. c-cyclical monotonicity
  3. Optimal transport
  4. Mathematical optimization
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 8 / 3 / Solution
  • Strong c-monotonicity

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook