Calculus of variations and optimal control; optimization Definition
Polyconvexity
Builds on Convex function on R^nMinorMorrey quasiconvexityRank-one convexity
Definition
Let and let denote the vector of all minors of all orders of a matrix . A function is polyconvex if there is a convex function with
Remarks
For , . For , , with the cofactor matrix.
Example: for , is polyconvex, with linear, although is not convex.
Example: for matrices, with for and for . It is polyconvex, since is convex on with values in .
Non-example: for , is not polyconvex. Along it equals , which is not convex. So is not rank-one convex, while every finite polyconvex function is.
For real-valued , polyconvexity implies quasiconvexity, and the converse fails when .
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Function concept
- Minor concept
- Morrey quasiconvexity concept
- Rank-one convexity concept
- Function of several variables concept
- Convex function on R^n concept
- Polyconvexity definition
Further reading
About this page
| Tag | S34G7679AK |
|---|---|
| URI | m2://S34G7679AK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 49J45, 26B25, 74B20 |
| Defines | Polyconvexity |
| Uses | Convex function on R^n, Minor, Morrey quasiconvexity, Rank-one convexity |
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.