Convergence of a steepest descent algorithm in shape optimisation using \(W^{1\infty}\) functions (Q6962586)

The authors propose a steepest descent gradient minimization algorithm to solve shape optimization problems subject to linear elliptic PDEs.\N\NParticular focus is put on the \(W^{1,\infty}\)-setting, which in contrast to prior work allows for finite element discretization independent of the spatial dimension. The authors provide two main convergence result, that is, convergence for the discrete problem with fixed mesh size, as well as convergence to the continuous problem for a suitable refinement parameter choice.