Exact relaxations of non-convex variational problems

René Meziat, Diego Patiño

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Here, we solve non-convex, variational problems given in the form Equation is presented where u ε(W 1,∞(0, 1)) k and f : ℝk → ℝ is a non-convex, coercive polynomial. To solve (1) we analyse the convex hull of the integrand at the point a, so that we can find vectors a1,...,aN ε ℝk and positive values λ1, . . . , λ N satisfying the non-linear equation (1, a, fc(a)) = ∑i=1M Nλ1(1, ai, f(ai)).(2) Thus, we can calculate minimizers of (1) by following a proposal of Dacorogna in (Direct Methods in the Calculus of Variations. Springer, Heidelberg, 1989). Indeed, we can solve (2) by using a semidefinite program based on multidimensional moments.

Original languageEnglish
Pages (from-to)505-519
Number of pages15
JournalOptimization Letters
Volume2
Issue number4
DOIs
StatePublished - Aug 2008
Externally publishedYes

Keywords

  • Calculus of variations
  • Convex analysis
  • Multidimensional moment problem
  • Semidefinite programming

Fingerprint

Dive into the research topics of 'Exact relaxations of non-convex variational problems'. Together they form a unique fingerprint.

Cite this