Abstract:The polyconvex envelope, used in the calculus of variations and elasticity theory, was expressed by Dacorogna pointwise as a linear program on finitely atomic measures on the space of $m\times n$ matrices. Weizsäcker and Winkler proved that the corresponding linear program on Borel measures restricts to the extreme points without increasing the infimum. Combining the two, one obtains a speed-up of grid-based algorithms and a new proof that the polyconvex envelope can be computed by the moment sum-of-squares hierarchy. Motivated by these applications, we seize the essence of extreme points in moment problems. First, we characterize extreme points of an affinely constrained convex set by the injectivity of the constraint map on the smallest faces containing them. We then study finitely many moment constraints. The extreme points are finitely atomic measures that have an affine independence property, under natural assumptions. We retrieve this known result with a simplified proof and apply it to faces of the probability simplex, among them the face of Radon measures. In the converse, we find that the assumption of a simplex is redundant. The Richter-Tchakaloff theorem allows us to show that the infimum of an integral functional restricts to the extreme points without increasing the infimum, not just for the known case of Radon measures but for any convex set of probability measures that contains the point measures.
From: Stephan Weis [view email]
[v1]
Fri, 19 Jun 2026 12:54:41 UTC (27 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。