PDE constrained shape optimisation with first-order and Newton-type methods in the $W^{1,\infty}$ topology
Klaus Deckelnick, Philip J. Herbert, Michael Hinze

TL;DR
This paper introduces a shape optimisation framework using $W^{1, Infty}$ topology with steepest descent and Newton algorithms, applied to PDE constrained problems, offering a novel approach compared to classical methods.
Contribution
It develops a $W^{1, Infty}$ topology-based shape optimisation method with new algorithms, extending previous work on star-shaped domains to PDE constrained problems.
Findings
The proposed algorithms outperform classical Hilbert space methods.
Comparison shows advantages of $W^{1, Infty}$ approach over $p$-approximations.
Numerical results demonstrate effectiveness in PDE constrained shape optimisation.
Abstract
We present a general shape optimisation framework based on the method of mappings in the topology. We propose steepest descent and Newton-like minimisation algorithms for the numerical solution of the respective shape optimisation problems. Our work is built upon previous work of the authors in (Deckelnick, Herbert, and Hinze, ESAIM: COCV 28 (2022)), where a framework for star-shaped domains is proposed. To illustrate our approach we present a selection of PDE constrained shape optimisation problems and compare our findings to results from so far classical Hilbert space methods and recent -approximations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopology Optimization in Engineering · Advanced Numerical Analysis Techniques · Piezoelectric Actuators and Control
