On the minimization of some nonconvex double obstacle problems (Q2570864)

Summary: We consider a nonconvex variational problem for which the set of admissible functions consists of all Lipschitz functions located between two fixed obstacles. It turns out that the value of the minimization problem at hand is equal to zero when the obstacles do not touch each other; otherwise, it might be positive. The results are obtained through the construction of suitable minimizing sequences. Interpolating these minimizing sequences in some discrete space, a numerical analysis is then carried out.