A numerical approach to variational problems subject to convexity constraint (Q5944669)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1654941
Language Label Description Also known as
default for all languages
No label defined
    English
    A numerical approach to variational problems subject to convexity constraint
    scientific article; zbMATH DE number 1654941

      Statements

      A numerical approach to variational problems subject to convexity constraint (English)
      0 references
      0 references
      0 references
      0 references
      23 June 2002
      0 references
      The problem to minimize the elliptic functional of the form \[ J(u)= \int_\Omega j(x,u(x),\nabla u(x)) dx \] on the set of convex functions \(u\) in an appropriate functional space \(X\) is important in economical applications. An approximate algorithm for solving this problem is introduced. A special case gives the convex envelope \(u^{**}_0\) of a given function \(u_0\). Let \(\{T_n\}\) be any quasiuniform sequence of meshes whose diameter goes to zero and \(I_n\) the corresponding affine interpolation operators. It is proved that the minimizer over \(C\) is the limit of sequence \(\{u_n\}\), where \(u_n\) minimizes the functional over \(I_n(C)\). The implementable characterization of \(I_n(C)\) is also given. It is shown that the finite-dimensional problem turns out to be a minimization problem with linear constraints.
      0 references
      elliptic functional
      0 references
      algorithm
      0 references
      convex envelope
      0 references
      affine interpolation
      0 references
      minimization
      0 references

      Identifiers