Convergence of a steepest descent algorithm in shape optimisation using W^1 functions

DOI10.1051/M2AN/2025033MaRDI QIDQ6962586zbMATH OpenFDO

Authors Klaus Deckelnick, Philip Justin Herbert, M. Hinze

Publication date 8 July 2025

Published in European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/M2AN/2025033

zbMATH Keywords

PDE-constrained shape optimization, \(W^{1-\infty}\)-steepest-descent, global convergence, finite element discretziation

Mathematics Subject Classification ID

PDEs in connection with control and optimization (35Q93) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Existence theories for optimal control problems involving partial differential equations (49J20) PDE constrained optimization (numerical aspects) (49M41) Optimization of shapes other than minimal surfaces (49Q10) Numerical optimization and variational techniques (65K10) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Control/observation systems governed by partial differential equations (93C20)

Review text

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.

Cites work

• N-dimensional shape optimization under capacitary constraint
• \textit{A priori} error estimates for finite element discretizations of a shape optimization problem
• A novel \(W^{1,\infty}\) approach to shape optimisation with Lipschitz domains
• Comparison of approximate shape gradients
• Convergence analysis of Galerkin finite element approximations to shape gradients in eigenvalue optimization
• Convergence analysis of mixed finite element approximations to shape gradients in the Stokes equation
• Efficient iterative solution of finite element discretized nonsmooth minimization problems
• Finite-element approximation of 2D elliptic optimal design
• Geometric partial differential equations. Part 2
• scientific article; zbMATH DE number 50725 (Why is no real title available?)
• Nonlinear potential theory of degenerate elliptic equations. With a new preface, corrigenda, and epilogue consisting of other new material
• Numerical Approximation of Optimal Convex Shapes
• On Convergence in Elliptic Shape Optimization
• On discrete shape gradients of boundary type for PDE-constrained shape optimization
• Shape optimization for Stokes flows: a finite element convergence analysis
• Shape variation and optimization. A geometrical analysis
• Shapes and geometries. Analysis, differential calculus, and optimization
• Shapes and geometries. Metrics, analysis, differential calculus, and optimization
• The \textsc{Dune} framework: basic concepts and recent developments
• Two-dimensional shape optimization with nearly conformal transformations

Cited in

(2)

• Shape optimization in \(W^{1,\infty}\) with geometric constraints: a study in distributed-memory systems
• Enhanced shape recovery in advection-diffusion problems via a novel ADMM-based CCBM optimization

This page was built for publication: Convergence of a steepest descent algorithm in shape optimisation using \(W^{1\infty}\) functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962586)