Quasiconvex functions can be approximated by quasiconvex polynomials

DOI10.1051/cocv:2008010zbMath1148.49012OpenAlexW2166509083MaRDI QIDQ3531529

Sebastian Heinz

Publication date: 31 October 2008

Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/245290

zbMATH Keywords

Stone-Weierstrass theoremlocally uniform convergence

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Approximation by polynomials (41A10)

Related Items (7)

Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice ⋮ Minimization of even conic functions on the two-dimensional integral lattice ⋮ A polynomial algorithm for minimizing discrete convic functions in fixed dimension ⋮ On the complexity of quasiconvex integer minimization problem ⋮ A method for pointwise evaluation of polyconvex envelopes ⋮ On the condition of tetrahedral polyconvexity, arising from calculus of variations ⋮ Quasiconvexity: the quadratic case revisited, and some consequences for fourth-degree polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An example of a quasiconvex function that is not polyconvex in two dimensions
• On the non-locality of quasiconvexity
• Partial differential equations 1. Foundations and integral representations. With consideration of lectures by E. Heinz
• Quasi-convexity and the lower semicontinuity of multiple integrals
• Nonlinear Cauchy-Riemann operators in ℝⁿ
• Some Open Problems in Elasticity
• Rank-one convexity does not imply quasiconvexity
• A sharp version of Zhang’s theorem on truncating sequences of gradients
• Direct methods in the calculus of variations

This page was built for publication: Quasiconvex functions can be approximated by quasiconvex polynomials