Optimal L^p-approximation of convex sets by convex subsets

Given a convex set Ω of Rⁿ, we consider the shape optimization problem of finding a convex subset ω⊂Ω, of a given measure, minimizing the p-distance functional [Formula presented] where 1≤p<∞ and h_ω and h_Ω are the support functions of ω and the fixed container Ω, respectively. We prove the existence of solutions and show that this minimization problem Γ-converges, when p tends to +∞, towards the problem of finding a convex subset ω⊂Ω, of a given measure, minimizing the Hausdorff distance to the convex Ω. In the planar case, we show that the free parts of the boundary of the optimal shapes, i.e., those that are in the interior of Ω, are given by polygonal lines. Still in the 2D setting, from a computational perspective, the classical method based on optimizing Fourier coefficients of support functions is not efficient, as it is unable to efficiently capture the presence of segments on the boundary of optimal shapes. We subsequently propose a method combining Fourier analysis and a numerical scheme recently introduced in Bogosel (2023), allowing to obtain accurate results, as demonstrated through numerical experiments.