Obstacle problem (source code)

= Obstacle problem
{wiki}

A classical <obstacle problem> minimizes the <Dirichlet energy> with forcing while requiring the unknown <function> to stay above an obstacle. On a bounded <Lipschitz domain> $\Omega$, take $f\in L^2(\Omega)$ and an obstacle $\psi\in H_0^1(\Omega)$. Minimize
$$
J(v)=\frac12\int_\Omega|\nabla v|^2-\int_\Omega fv
\quad\text{over}\quad K=\{v\in H_0^1(\Omega):v\geq\psi\text{ almost everywhere}\}.
$$
The closed <convex set> $K$ is nonempty, and the <Poincaré inequality> makes $J$ coercive and strictly convex. There is a unique minimizer $u$, characterized by the <variational inequality>
$$
\int_\Omega\nabla u\cdot\nabla(v-u)\geq\int_\Omega f(v-u)\qquad(v\in K).
$$
It follows by differentiating $J(u+t(v-u))$ at $t=0^+$; convexity also makes the inequality sufficient for minimality.

Where regularity permits pointwise notation, the same conditions read $u\geq\psi$, $-\Delta u-f\geq0$, and $(u-\psi)(-\Delta u-f)=0$. On the <noncontact set>, variations of both signs recover the unconstrained <Poisson equation>. On the <contact set of an obstacle problem>, the obstacle can supply a reaction force. Its interface is an unknown <free boundary problem>. An analogous separation into stopping and continuation regions appears in <optimal stopping>, where the value must dominate the immediate payoff.