Numerical shape optimization among convex sets - Archive ouverte HAL Access content directly
Journal Articles Applied Mathematics and Optimization Year : 2023

Numerical shape optimization among convex sets

Abstract

This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate discrete convex shapes and is easily implementable using standard optimization software. The framework can handle various objective functions ranging from geometric quantities to functionals depending on partial differential equations. Width or diameter constraints are handled using the support function. Functionals depending on a convex body and its polar body can be handled using a unified framework.
Fichier principal
Vignette du fichier
DiscreteConvex.pdf (860.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03607776 , version 1 (14-03-2022)

Identifiers

Cite

Beniamin Bogosel. Numerical shape optimization among convex sets. Applied Mathematics and Optimization, 2023, 87 (1), pp.1. ⟨10.1007/s00245-022-09920-w⟩. ⟨hal-03607776⟩
46 View
190 Download

Altmetric

Share

Gmail Facebook X LinkedIn More