Non-conforming and conforming methods for minimization problems exhibiting the Lavrentiev phenomenon

I will begin by talking briefly about the Lavrentiev phenomenon and its implications for computations. In short, if a minimization problem exhibits a Lavrentiev gap then `naive' numerical methods cannot be used to solve it. In the past, several regularization techniques have been used to overcome this difficulty. I will briefly mention them and discuss their strengths and weaknesses.

The main part of the talk will be concerned with a class of convex problems, and I will show that for this class, relatively simple numerical methods, namely (i) the Crouzeix--Raviart FEM and (ii) the P2-FEM with under-integration, can successfully overcome the Lavrentiev gap.