Calculus of variations and optimal control; optimization Definition
c-cyclical monotonicity
Builds on Coupling
Definition
Let and be sets and let be a function, the cost. A set is -cyclically monotone if for every integer and all pairs , where . Let and be topological spaces, and let be a Borel measure on , such as a coupling. Then is -cyclically monotone if it is concentrated on a -cyclically monotone Borel set.
Remarks
Example: let , and , the diagonal. The left side of the inequality is and the right side is a sum of squares, so the inequality holds and is -cyclically monotone.
Non-example: with the same cost, fails for : the left side is and the right side is .
Equivalently, the inequality may be required for every permutation of , with in place of , since every permutation is a product of disjoint cycles. For and , a set is -cyclically monotone exactly when it is cyclically monotone in the sense of Rockafellar, that is, with .
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
- no evidence level
- Coupling concept
- c-cyclical monotonicity definition
Further reading
About this page
| Tag | DEHZAQ1N92 |
|---|---|
| URI | m2://DEHZAQ1N92 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 49Q22, 49N15 |
| Defines | c-cyclical monotonicity |
| Uses | Coupling |
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.