Rahul Sharma (Editor)

Polyconvex function

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, the notion of polyconvexity is a generalization of the notion of convexity for functions defined on spaces of matrices. Let Mm×n(K) denote the space of all m × n matrices over the field K, which may be either the real numbers R, or the complex numbers C. A function f : Mm×n(K) → R ∪ {±∞} is said to be polyconvex if

A f ( A )

can be written as a convex function of the p × p subdeterminants of A, for 1 ≤ p ≤ min{mn}.

Polyconvexity is a weaker property than convexity. For example, the function f given by

f ( A ) = { 1 det ( A ) , det ( A ) > 0 ; + , det ( A ) 0 ;

is polyconvex but not convex.

References

Polyconvex function Wikipedia