A numerical approach to variational problems subject to convexity constraint

Summary. We describe an algorithm to approximate the minimizer of an elliptic functional in the form on the set of convex functions u in an appropriate functional space X. Such problems arise for instance in mathematical economics 4]. A special case gives the convex envelope of a given function . Let be any quasiuniform sequence of meshes whose diameter goes to zero, and the corresponding affine interpolation operators. We prove that the minimizer over is the limit of the sequence , where minimizes the functional over . We give an implementable characterization of . Then the finite dimensional problem turns out to be a minimization problem with linear constraints. Received November 24, 1999 / Published online October 16, 2000