Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T04:27:11.992Z Has data issue: false hasContentIssue false

Numerical optimization and quasiconvexity

Published online by Cambridge University Press:  26 September 2008

P. A. Gremaud
Affiliation:
School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA

Abstract

In the Calculus of Variations, several notions of convexity have emerged, corresponding to different properties of the functionals to be minimized. The relations between these various notions are not yet fully understood. In this context, we present a numerical study of quasiconvexity for some functions of the type f(ξ) = g(|ξ|2, det ξ), where Ξ is a 2×2-matrix. The corresponding global optimization problems are solved using a simulated annealing-like algorithm. The computations strongly indicate that the considered functions are quasiconvex if and only if they are rank-one convex. The relation to Morrey's conjecture, various applications and implementation problems are discussed.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable