Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T11:07:11.379Z Has data issue: false hasContentIssue false

Shape and topology optimization of the robust compliance via the level setmethod

Published online by Cambridge University Press:  21 September 2007

Frédéric de Gournay
Affiliation:
Centre de Mathématiques Appliquées (UMR 7641), École Polytechnique, 91128 Palaiseau, France; degourna@cmapx.polytechnique.fr; allaire@cmapx.polytechnique.fr; jouve@cmapx.polytechnique.fr
Grégoire Allaire
Affiliation:
Centre de Mathématiques Appliquées (UMR 7641), École Polytechnique, 91128 Palaiseau, France; degourna@cmapx.polytechnique.fr; allaire@cmapx.polytechnique.fr; jouve@cmapx.polytechnique.fr
François Jouve
Affiliation:
Centre de Mathématiques Appliquées (UMR 7641), École Polytechnique, 91128 Palaiseau, France; degourna@cmapx.polytechnique.fr; allaire@cmapx.polytechnique.fr; jouve@cmapx.polytechnique.fr
Get access

Abstract

The goal of this paper is to study the so-called worst-case or robustoptimal design problem for minimal compliance. In the context of linear elasticity we seek an optimal shape which minimizes the largest, or worst,compliance when the loads are subject to some unknown perturbations.We first prove that, for a fixed shape, there exists indeed a worst perturbation (possibly non unique) that we characterize as the maximizer of a nonlinear energy. We also propose a stable algorithm tocompute it. Then, in the framework of Hadamard method, wecompute the directional shape derivative of this criterion which isused in a numerical algorithm, based on the level set method,to find optimal shapes that minimize the worst-case compliance.Since this criterion is usually merely directionally differentiable,we introduce a semidefinite programming approach toselect the best descent direction at each step of agradient method. Numerical examples are given in 2-d and 3-d.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable