Polyconvex, quasiconvex and rank one convex sets

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We now discuss the notions of polyconvex, quasiconvex and rank one convex sets. Contrary to the usual presentation of classical convex analysis, where the notion of a convex set is defined prior to that of a convex function; this is not the case for the generalized notions of convexity. This is of course due to historical reasons. The notions of polyconvex, quasiconvex and rank one convex functions were introduced, as already said, by Morrey in 1952, although the terminology is that of Ball [53]. It was not until the systematic studies of partial differential equations and inclusions by Dacorogna-Marcellini and Müller-Sverak, initiated in 1996 and discussed in Chapter 10, that the equivalent definitions for sets became an important issue. Moreover these notions were essentially seen through the different generalized convex hulls, leading somehow to terminologies that do not exactly cover the same concepts. We here try to imitate as much as possible the classical approach of convex analysis in the present context. Throughout the two first sections, we follow the presentation of Dacorogna-Ribeiro [213], following earlier results of Dacorogna- Marcellini [202].

Cite

CITATION STYLE

APA

Polyconvex, quasiconvex and rank one convex sets. (2008). In Applied Mathematical Sciences (Switzerland) (Vol. 78, pp. 313–366). Springer. https://doi.org/10.1007/978-0-387-55249-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free