2018
DOI: 10.4171/178
|View full text |Cite
|
Sign up to set email alerts
|

Shape Variation and Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

3
316
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 191 publications
(319 citation statements)
references
References 0 publications
3
316
0
Order By: Relevance
“…smoothness of (v, ξ) → div(A(v)∇ξ) is proved as in[11, Theorem 5.3.2] and we have indeed establishedF ∈ C 1 S × H 1 0 (Ω(u)), H −1 (Ω(u)) . By the Lax-Milgram theorem, the mapping ζ → ∂ ξ F (u, χ u )ζ = −div(σ∇ζ) is bijective from H 1 0 (Ω(u)) to H −1 (Ω(u))and thus an isomorphism due to the open mapping theorem.…”
mentioning
confidence: 56%
See 3 more Smart Citations
“…smoothness of (v, ξ) → div(A(v)∇ξ) is proved as in[11, Theorem 5.3.2] and we have indeed establishedF ∈ C 1 S × H 1 0 (Ω(u)), H −1 (Ω(u)) . By the Lax-Milgram theorem, the mapping ζ → ∂ ξ F (u, χ u )ζ = −div(σ∇ζ) is bijective from H 1 0 (Ω(u)) to H −1 (Ω(u))and thus an isomorphism due to the open mapping theorem.…”
mentioning
confidence: 56%
“…Next, due to the regularity properties of ψ u provided by Theorem 1.1, we can compute the shape derivative of the Dirichlet energy J(u) with respect to u ∈ S in a classical way [11,20]. Theorem 1.2.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…As a matter of fact, advanced mathematical programming methods are not frequently described in the literature devoted to shape optimization based on Hadamard's method (see [35,56] for an introduction). In most contributions, where, usually, only one constraint is considered, standard Penalty and Augmented Lagrangian Methods are used for the sake of implementation simplicity [9,23].…”
mentioning
confidence: 99%