A numerical approach to variational problems subject to convexity constraint (Q5944669): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s002110000235 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S002110000235 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:12, 9 December 2024
scientific article; zbMATH DE number 1654941
Language | Label | Description | Also known as |
---|---|---|---|
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
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