Calculus of variations and optimal control; optimization Definition
Rank-one convexity
Builds on Convex function on R^nRank of a matrix
Definition
Let and let . For and , write for the matrix with entries ; it has rank at most one. The function is rank-one convex if for every , and the function is convex.
Remarks
Example: for , is rank-one convex. By the matrix determinant lemma, , which is affine in . But is not convex: along it equals .
Non-example: for , is not rank-one convex, since is not convex.
For or every matrix has rank at most one, so rank-one convexity is ordinary convexity. If is , it is rank-one convex exactly when for all , and , the Legendre–Hadamard condition.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Function concept
- Rank of a matrix concept
- Function of several variables concept
- Convex function on R^n concept
- Rank-one convexity definition
Further reading
About this page
| Tag | TPC99RZ316 |
|---|---|
| URI | m2://TPC99RZ316 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 49J45, 26B25 |
| Defines | Rank-one convexity |
| Uses | Convex function on R^n, Rank of a matrix |
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.