Math 2.0

Calculus of variations and optimal control; optimization Definition

c-cyclical monotonicity

Builds on Coupling

Definition

Let XX and YY be sets and let c ⁣:X×Y→(−∞,∞]c \colon X \times Y \to (-\infty, \infty] be a function, the cost. A set Γ⊆X×Y\Gamma \subseteq X \times Y is cc-cyclically monotone if for every integer N≥1N \ge 1 and all pairs (x1,y1),…,(xN,yN)∈Γ(x_1, y_1), \dots, (x_N, y_N) \in \Gamma, ∑i=1Nc(xi,yi)≤∑i=1Nc(xi,yi+1),\sum_{i=1}^{N} c(x_i, y_i) \le \sum_{i=1}^{N} c(x_i, y_{i+1}), where yN+1=y1y_{N+1} = y_1. Let XX and YY be topological spaces, and let π\pi be a Borel measure on X×YX \times Y, such as a coupling. Then π\pi is cc-cyclically monotone if it is concentrated on a cc-cyclically monotone Borel set.

Remarks

Example: let X=Y=ℝX = Y = \R, c(x,y)=(x−y)2c(x, y) = (x - y)^2 and Γ={(x,x):x∈ℝ}\Gamma = \set{(x, x) : x \in \R}, the diagonal. The left side of the inequality is 00 and the right side is a sum of squares, so the inequality holds and Γ\Gamma is cc-cyclically monotone.

Non-example: with the same cost, Γ={(0,1),(1,0)}\Gamma = \set{(0, 1), (1, 0)} fails for N=2N = 2: the left side is 1+1=21 + 1 = 2 and the right side is c(0,0)+c(1,1)=0c(0, 0) + c(1, 1) = 0.

Equivalently, the inequality may be required for every permutation σ\sigma of {1,…,N}\set{1, \dots, N}, with yσ(i)y_{\sigma(i)} in place of yi+1y_{i+1}, since every permutation is a product of disjoint cycles. For X=Y=ℝnX = Y = \R^n and c(x,y)=12∣x−y∣2c(x, y) = \frac12 \abs{x - y}^2, a set is cc-cyclically monotone exactly when it is cyclically monotone in the sense of Rockafellar, that is, ∑i⟨yi,xi+1−xi⟩≤0\sum_i \ip{y_i}{x_{i+1} - x_i} \le 0 with xN+1=x1x_{N+1} = x_1.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Coupling concept
  2. c-cyclical monotonicity definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Transportation_theory_(mathematics)
About this page
TagDEHZAQ1N92
URIm2://DEHZAQ1N92
Kinddefinition
WritingW0 stub
MSC49Q22, 49N15
Definesc-cyclical monotonicity
UsesCoupling

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.