• Aucun résultat trouvé

New results about shape derivatives and convexity constraint

N/A
N/A
Protected

Academic year: 2022

Partager "New results about shape derivatives and convexity constraint"

Copied!
68
0
0

Texte intégral

(1)

New results about shape derivatives and convexity constraint

Jimmy LAMBOLEY University Paris-Dauphine

with A. Novruzi, M. Pierre

29/04/2016, Cortona

Geometric aspects of PDE’s and functional inequalities

(2)

Main motivation

Convexity constraint in shape optimization

We are interested in problems of the form : min

n

J(Ω), Ω is convex , Ω ∈ F ad

o

where J is a shape functional.

Examples of constraints : F ad =

Ω, B (0, a) ⊂ Ω ⊂ B (0, b) , F ad =

| Ω | = V 0 , and Ω ⊂ B (0, b) .

(3)

Main motivation

Convexity constraint in shape optimization

We are interested in problems of the form : min

n

J(Ω), Ω is convex , Ω ∈ F ad

o

where J is a shape functional.

Examples of constraints : F ad =

Ω, B (0, a) ⊂ Ω ⊂ B (0, b) , F ad =

| Ω | = V 0 , and Ω ⊂ B (0, b) .

(4)

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(5)

Convexity constraint

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(6)

Convexity constraint Old, new, open problems

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(7)

Convexity constraint Old, new, open problems

Example I

Newton’s problem of the body of minimal resistance [1685]

min Z

D

1

1 + |∇ f | 2 / f : D → [0, M], f concave

D = { x ∈ R 2 , | x | ≤ 1 }

Numerical computations : Lachand-Robert, Oudet, 2004 :

M = 3/2 M = 1

M = 7/10 M = 4/10

Figure 6: Computed solutions of Newton’s problem of the body of minimal resistance.

used ! = 300.) In this particular problem, this yields an overestimated value of the functional. Indeed if A ⊂ Ω

!

× [0, M ] is convex, then ˜ A := A ∩ Q

1

belongs to A , and F ( ˜ A) ≤ F (A) since f ≥ 0 and vanishes on ∂ A ˜ \ ∂A, where the normal vectors belong to { e

3

}

. Obviously for a minimization problem, this is not a predicament to overestimate the functional.

14

hal-00385109, version 1 - 18 May 2009

(8)

Convexity constraint Old, new, open problems

Example I

Newton’s problem of the body of minimal resistance [1685]

min Z

D

1

1 + |∇ f | 2 / f : D → [0, M], f concave

D = { x ∈ R 2 , | x | ≤ 1 }

Numerical computations : Lachand-Robert, Oudet, 2004 :

M = 3/2 M = 1

M = 7/10 M = 4/10

Figure 6: Computed solutions of Newton’s problem of the body of minimal resistance.

used ! = 300.) In this particular problem, this yields an overestimated value of the functional. Indeed if A ⊂ Ω × [0, M ] is convex, then ˜ A := A ∩ Q

hal-00385109, version 1 - 18 May 2009

J. Lamboley (University Paris-Dauphine) Optimal convex shapes 6 / 28

(9)

Convexity constraint Old, new, open problems

Example II

Mahler’s conjecture [1939]

Conjecture : is the cube Q N := [ − 1, 1] N solution of min

n

M(K ) := | K || K | , K convex of R N , − K = K o

? where

K := n

ξ ∈ R N , h ξ, x i ≤ 1, ∀ x ∈ K o .

Theorem (Mahler, 1939)

If N = 2, ok.

(10)

Convexity constraint Old, new, open problems

Example II

Mahler’s conjecture [1939]

Conjecture : is the cube Q N := [ − 1, 1] N solution of min

n

M(K ) := | K || K | , K convex of R N , − K = K o

? where

K := n

ξ ∈ R N , h ξ, x i ≤ 1, ∀ x ∈ K o .

Theorem (Mahler, 1939)

(11)

Convexity constraint Old, new, open problems

Example III

P´ olya-Szeg¨ o’s conjecture [1951]

The electrostatic capacity of a set Ω ⊂ R 3 is defined by

Cap(K ) :=

Z

R

3

\ K |∇ u K | 2 where

 

 

∆u K = 0 in R 3 \ K

u K = 1 on ∂K

| x |→ lim + ∞ u K = 0

Is the disk D ⊂ R 3 solution of : min

Cap(K ), K convex of R 3 , P (K ) = P 0 ? or equivalently solution of

min

Cap(K ) 2

P (K ) , K convex

⇔ min

Cap(K ) 2 − µP(K ), K convex

(12)

Convexity constraint Old, new, open problems

Example III

P´ olya-Szeg¨ o’s conjecture [1951]

The electrostatic capacity of a set Ω ⊂ R 3 is defined by

Cap(K ) :=

Z

R

3

\ K |∇ u K | 2 where

 

 

∆u K = 0 in R 3 \ K

u K = 1 on ∂K

| x |→ lim + ∞ u K = 0 Is the disk D ⊂ R 3 solution of :

min

Cap(K ), K convex of R 3 , P (K ) = P 0 ?

or equivalently solution of min

Cap(K ) 2

P (K ) , K convex

⇔ min

Cap(K ) 2 − µP(K ), K convex

(13)

Convexity constraint Old, new, open problems

Example III

P´ olya-Szeg¨ o’s conjecture [1951]

The electrostatic capacity of a set Ω ⊂ R 3 is defined by

Cap(K ) :=

Z

R

3

\ K |∇ u K | 2 where

 

 

∆u K = 0 in R 3 \ K

u K = 1 on ∂K

| x |→ lim + ∞ u K = 0 Is the disk D ⊂ R 3 solution of :

min

Cap(K ), K convex of R 3 , P (K ) = P 0 ? or equivalently solution of

min

Cap(K ) 2

P (K ) , K convex

⇔ min

Cap(K ) 2 − µP(K ), K convex

(14)

Convexity constraint Old, new, open problems

Example IV

Variations on the charged liquid drop problem [Goldman, Novaga, Ruffini, 2016]

min { P (Ω) + Q 2 I 0 (Ω), Ω convex ⊂ R N , | Ω | = V 0 } I 0 (Ω) = inf

µ ∈P (Ω)

Z

Ω × Ω

log 1

| x − y |

d µ(x)d µ(y) = 1 Lcap(Ω)

Existence ok

If N = 2, C 1,1 -regularity of solutions Ball if Q is small enough

Convergence to a segment if Q → ∞ (after rescaling).

(15)

Convexity constraint Old, new, open problems

Example IV

Variations on the charged liquid drop problem [Goldman, Novaga, Ruffini, 2016]

min { P (Ω) + Q 2 I 0 (Ω), Ω convex ⊂ R N , | Ω | = V 0 } I 0 (Ω) = inf

µ ∈P (Ω)

Z

Ω × Ω

log 1

| x − y |

d µ(x)d µ(y) = 1 Lcap(Ω) Existence ok

If N = 2, C 1,1 -regularity of solutions Ball if Q is small enough

Convergence to a segment if Q → ∞ (after rescaling).

(16)

Convexity constraint Old, new, open problems

Example IV

Variations on the charged liquid drop problem [Goldman, Novaga, Ruffini, 2016]

min { P (Ω) + Q 2 I 0 (Ω), Ω convex ⊂ R N , | Ω | = V 0 } I 0 (Ω) = inf

µ ∈P (Ω)

Z

Ω × Ω

log 1

| x − y |

d µ(x)d µ(y) = 1 Lcap(Ω) Existence ok

If N = 2, C 1,1 -regularity of solutions

Ball if Q is small enough

Convergence to a segment if Q → ∞ (after rescaling).

(17)

Convexity constraint Old, new, open problems

Example IV

Variations on the charged liquid drop problem [Goldman, Novaga, Ruffini, 2016]

min { P (Ω) + Q 2 I 0 (Ω), Ω convex ⊂ R N , | Ω | = V 0 } I 0 (Ω) = inf

µ ∈P (Ω)

Z

Ω × Ω

log 1

| x − y |

d µ(x)d µ(y) = 1 Lcap(Ω) Existence ok

If N = 2, C 1,1 -regularity of solutions Ball if Q is small enough

Convergence to a segment if Q → ∞ (after rescaling).

(18)

Convexity constraint Old, new, open problems

Example V : Reverse isoperimetry

[Bianchini-Henrot 2012]

min n

µ | Ω | − P (Ω), Ω convex ⊂ R N , B(0, a) ⊂ Ω ⊂ B(0, b) o

If N = 2,

Big ball if µ small, Small ball if µ big,

Polygonal inside B(0, b) \ B (0, a) [L-Novruzi 2008]

Complete description available [Bianchini-Henrot] : ’true’ polygons

(19)

Convexity constraint Old, new, open problems

Example V : Reverse isoperimetry

[Bianchini-Henrot 2012]

min n

µ | Ω | − P (Ω), Ω convex ⊂ R N , B(0, a) ⊂ Ω ⊂ B(0, b) o

If N = 2,

Big ball if µ small, Small ball if µ big,

Polygonal inside B(0, b) \ B (0, a) [L-Novruzi 2008]

Complete description available [Bianchini-Henrot] : ’true’ polygons

(20)

Convexity constraint Old, new, open problems

Example V : Reverse isoperimetry

[Bianchini-Henrot 2012]

min n

µ | Ω | − P (Ω), Ω convex ⊂ R N , B(0, a) ⊂ Ω ⊂ B(0, b) o

If N = 2,

Big ball if µ small, Small ball if µ big,

Polygonal inside B(0, b) \ B (0, a) [L-Novruzi 2008]

Complete description available [Bianchini-Henrot] : ’true’ polygons

(21)

Convexity constraint Old, new, open problems

Example V : Reverse isoperimetry

[Bianchini-Henrot 2012]

min n

µ | Ω | − P (Ω), Ω convex ⊂ R N , B(0, a) ⊂ Ω ⊂ B(0, b) o

If N = 2,

Big ball if µ small, Small ball if µ big,

Polygonal inside B(0, b) \ B (0, a) [L-Novruzi 2008]

Complete description available [Bianchini-Henrot] : ’true’ polygons

(22)

Convexity constraint Old, new, open problems

Example VI

Variation on the Cheeger inequality [Parini, 2015]

min

λ 1 (Ω)

h 1 (Ω) 2 , Ω convex ⊂ R N

If N = 2,

Existence ok

every connected component of ∂Ω \ ∂C is made of two segments

understanding ∂Ω ∩ ∂C ? Can it be strictly convex ?

(23)

Convexity constraint Old, new, open problems

Example VI

Variation on the Cheeger inequality [Parini, 2015]

min

λ 1 (Ω)

h 1 (Ω) 2 , Ω convex ⊂ R N

If N = 2,

Existence ok

every connected component of ∂Ω \ ∂C is made of two segments

understanding ∂Ω ∩ ∂C ? Can it be strictly convex ?

(24)

Convexity constraint Old, new, open problems

Example VI

Variation on the Cheeger inequality [Parini, 2015]

min

λ 1 (Ω)

h 1 (Ω) 2 , Ω convex ⊂ R N

If N = 2,

Existence ok

every connected component of ∂Ω \ ∂C is made of two segments

understanding ∂Ω ∩ ∂C ? Can it be strictly convex ?

(25)

Convexity constraint Old, new, open problems

Example VI

Variation on the Cheeger inequality [Parini, 2015]

min

λ 1 (Ω)

h 1 (Ω) 2 , Ω convex ⊂ R N

If N = 2,

Existence ok

every connected component of ∂Ω \ ∂C is made of two segments

understanding ∂Ω ∩ ∂C ? Can it be strictly convex ?

(26)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’ Examples I,II,III,V, maybe VI

Use second order optimality condition !

(27)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult

(Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’ Examples I,II,III,V, maybe VI

Use second order optimality condition !

(28)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 ,

Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’ Examples I,II,III,V, maybe VI

Use second order optimality condition !

(29)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’ Examples I,II,III,V, maybe VI

Use second order optimality condition !

(30)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’ Examples I,II,III,V, maybe VI

Use second order optimality condition !

(31)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’ Examples I,II,III,V, maybe VI

Use second order optimality condition !

(32)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

Use second order optimality condition !

(33)

Convexity constraint Old, new, open problems

Few formal remarks/results

Existence of a minimizer is usually easy.

’Non-existence’ may be difficult (Marini’s talk about τ and λ 1 , Fundamental Gap Theorem [Andrews-Clutterbuck 2011]).

To get geometrical/analytical informations on minimizers is usually difficult (optimality conditions ?)

If J = P + G where G is ‘smooth enough’, then we expect Ω to be smooth (C 1,1 ), [LNP 2011, GNR 2016, L. 201X ?]

Example IV : the charged drop like problem

If J is ’weakly concave’, then we expect Ω to be ’weakly extremal’

Examples I,II,III,V, maybe VI

Use second order optimality condition !

(34)

Convexity constraint Case of concave functionals

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(35)

Convexity constraint Case of concave functionals

The gauge function

If N ≥ 2, and u : S N 1 → (0, ∞ ) is given, we define Ω u :=

(r, θ) ∈ [0, ∞ ) × S N 1 , r < 1 u(θ)

.

Then

Ω u is convex if and only if u is convex on S N 1 .

(36)

Convexity constraint Case of concave functionals

The gauge function

If N ≥ 2, and u : S N 1 → (0, ∞ ) is given, we define Ω u :=

(r, θ) ∈ [0, ∞ ) × S N 1 , r < 1 u(θ)

. Then

Ω u is convex if and only if u is convex on S N 1 .

(37)

Convexity constraint Case of concave functionals

Reformulation of the problem

min n

J(Ω), Ω convex , Ω ∈ F ad }

⇐⇒ min n

j (u ) := J(Ω u ), u convex , u ∈ S ad

o

For example,

S ad = n

u : S N 1 → R , a ≤ 1/u ≤ b

o

(38)

Convexity constraint Case of concave functionals

Reformulation of the problem

min n

J(Ω), Ω convex , Ω ∈ F ad }

⇐⇒ min n

j (u ) := J(Ω u ), u convex , u ∈ S ad

o

For example,

S ad = n

u : S N 1 → R , a ≤ 1/u ≤ b

o

(39)

Convexity constraint Case of concave functionals

Minimization of locally concave functionals

Let u 0 such that :

j (u 0 ) = min n

j (u), u convex, u ∈ S ad o

Theorem (L.,Novruzi,Pierre 2015) Assume, for any v ∈ W 1,∞ ( S N 1 ),

j 00 (u 0 )(v, v) ≤ − α | v | 2 H

1

( S

N−1

) + β k v k 2 H

s

( S

N−1

) . (H) for some α > 0, s ∈ [0, 1).Then the set

T u

0

= n

v/ ∃ ε > 0, ∀| t | < ε, u 0 + tv is convex and ∈ S ad o

,

is a linear vector space of finite dimension.

(40)

Convexity constraint Case of concave functionals

Minimization of locally concave functionals

Let u 0 such that :

j (u 0 ) = min n

j (u), u convex, u ∈ S ad o

Theorem (L.,Novruzi,Pierre 2015) Assume, for any v ∈ W 1,∞ ( S N 1 ),

j 00 (u 0 )(v, v) ≤ − α | v | 2 H

1

( S

N−1

) + β k v k 2 H

s

( S

N−1

) . (H) for some α > 0, s ∈ [0, 1).

Then the set T u

0

= n

v/ ∃ ε > 0, ∀| t | < ε, u 0 + tv is convex and ∈ S ad o

,

is a linear vector space of finite dimension.

(41)

Convexity constraint Case of concave functionals

Minimization of locally concave functionals

Let u 0 such that :

j (u 0 ) = min n

j (u), u convex, u ∈ S ad o

Theorem (L.,Novruzi,Pierre 2015) Assume, for any v ∈ W 1,∞ ( S N 1 ),

j 00 (u 0 )(v, v) ≤ − α | v | 2 H

1

( S

N−1

) + β k v k 2 H

s

( S

N−1

) . (H) for some α > 0, s ∈ [0, 1).Then the set

T u

0

= n

v/ ∃ ε > 0, ∀| t | < ε, u 0 + tv is convex and ∈ S ad o

,

is a linear vector space of finite dimension.

(42)

Convexity constraint Case of concave functionals

Consequences

Let u 0 such that T u

0

is of finite dimension.

N = 2, u 0 can be seen as a 2π-periodic function. Lemma (Lachand-Robert Peletier, L. Novruzi Pierre)

Then u 00 0 + u 0 is a sum of Dirac masses, or equivalently Ω u

0

is polygonal, inside B(0, b) \ B(0, a).

N ≥ 3 Lemma (easy)

Then if ω ⊂ ∂Ω u

0

is C 2 , then the Gauss curvature vanishes on ω

Problem : Ω u

0

is not necessarily a polyhedra.

(43)

Convexity constraint Case of concave functionals

Consequences

Let u 0 such that T u

0

is of finite dimension.

N = 2, u 0 can be seen as a 2π-periodic function.

Lemma (Lachand-Robert Peletier, L. Novruzi Pierre)

Then u 00 0 + u 0 is a sum of Dirac masses, or equivalently Ω u

0

is polygonal, inside B(0, b) \ B(0, a).

N ≥ 3 Lemma (easy)

Then if ω ⊂ ∂Ω u

0

is C 2 , then the Gauss curvature vanishes on ω

Problem : Ω u

0

is not necessarily a polyhedra.

(44)

Convexity constraint Case of concave functionals

Consequences

Let u 0 such that T u

0

is of finite dimension.

N = 2, u 0 can be seen as a 2π-periodic function.

Lemma (Lachand-Robert Peletier, L. Novruzi Pierre) Then u 00 0 + u 0 is a sum of Dirac masses,

or equivalently Ω u

0

is polygonal, inside B(0, b) \ B(0, a).

N ≥ 3 Lemma (easy)

Then if ω ⊂ ∂Ω u

0

is C 2 , then the Gauss curvature vanishes on ω

Problem : Ω u

0

is not necessarily a polyhedra.

(45)

Convexity constraint Case of concave functionals

Consequences

Let u 0 such that T u

0

is of finite dimension.

N = 2, u 0 can be seen as a 2π-periodic function.

Lemma (Lachand-Robert Peletier, L. Novruzi Pierre)

Then u 00 0 + u 0 is a sum of Dirac masses, or equivalently Ω u

0

is polygonal, inside B(0, b) \ B(0, a).

N ≥ 3 Lemma (easy)

Then if ω ⊂ ∂Ω u

0

is C 2 , then the Gauss curvature vanishes on ω

Problem : Ω u

0

is not necessarily a polyhedra.

(46)

Convexity constraint Case of concave functionals

Consequences

Let u 0 such that T u

0

is of finite dimension.

N = 2, u 0 can be seen as a 2π-periodic function.

Lemma (Lachand-Robert Peletier, L. Novruzi Pierre)

Then u 00 0 + u 0 is a sum of Dirac masses, or equivalently Ω u

0

is polygonal, inside B(0, b) \ B(0, a).

N ≥ 3 Lemma (easy)

Problem : Ω u

0

is not necessarily a polyhedra.

(47)

Convexity constraint Case of concave functionals

Consequences

Let u 0 such that T u

0

is of finite dimension.

N = 2, u 0 can be seen as a 2π-periodic function.

Lemma (Lachand-Robert Peletier, L. Novruzi Pierre)

Then u 00 0 + u 0 is a sum of Dirac masses, or equivalently Ω u

0

is polygonal, inside B(0, b) \ B(0, a).

N ≥ 3 Lemma (easy)

Then if ω ⊂ ∂Ω u

0

is C 2 , then the Gauss curvature vanishes on ω

Problem : Ω is not necessarily a polyhedra.

(48)

Convexity constraint Applications

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(49)

Convexity constraint Applications

Results

min n

J(Ω) := − P (Ω) + F (Ω), Ω convex o

where F (K ) = f ( | K | , λ 1 (K )).

Theorem (L.-Novruzi-Pierre 2011-2015) J satisfies (H).

Example V, reverse isoperimetry

min { J(Ω) := − P (Ω) + µ | Ω | ; Ω convex in R N } . Example V bis

min { J(Ω) := − P (Ω) + µλ 1 (Ω) ; Ω convex in R N , | Ω | = V 0 } .

Example VI (Enea’s problem) ?

(50)

Convexity constraint Applications

Results

min n

J(Ω) := − P (Ω) + F (Ω), Ω convex o

where F (K ) = f ( | K | , λ 1 (K )).

Theorem (L.-Novruzi-Pierre 2011-2015) J satisfies (H).

Example V, reverse isoperimetry

min { J(Ω) := − P (Ω) + µ | Ω | ; Ω convex in R N } . Example V bis

min { J(Ω) := − P (Ω) + µλ 1 (Ω) ; Ω convex in R N , | Ω | = V 0 } .

Example VI (Enea’s problem) ?

(51)

Convexity constraint Applications

Results

min n

J(Ω) := − P (Ω) + F (Ω), Ω convex o

where F (K ) = f ( | K | , λ 1 (K )).

Theorem (L.-Novruzi-Pierre 2011-2015) J satisfies (H).

Example V, reverse isoperimetry

min { J(Ω) := − P (Ω) + µ | Ω | ; Ω convex in R N } .

Example V bis

min { J(Ω) := − P (Ω) + µλ 1 (Ω) ; Ω convex in R N , | Ω | = V 0 } .

Example VI (Enea’s problem) ?

(52)

Convexity constraint Applications

Results

min n

J(Ω) := − P (Ω) + F (Ω), Ω convex o

where F (K ) = f ( | K | , λ 1 (K )).

Theorem (L.-Novruzi-Pierre 2011-2015) J satisfies (H).

Example V, reverse isoperimetry

min { J(Ω) := − P (Ω) + µ | Ω | ; Ω convex in R N } . Example V bis

Example VI (Enea’s problem) ?

(53)

Convexity constraint Applications

Results

min n

J(Ω) := − P (Ω) + F (Ω), Ω convex o

where F (K ) = f ( | K | , λ 1 (K )).

Theorem (L.-Novruzi-Pierre 2011-2015) J satisfies (H).

Example V, reverse isoperimetry

min { J(Ω) := − P (Ω) + µ | Ω | ; Ω convex in R N } . Example V bis

min { J(Ω) := − P (Ω) + µλ 1 (Ω) ; Ω convex in R N , | Ω | = V 0 } .

(54)

Shape derivatives

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(55)

Shape derivatives Previous results (2-dim)

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(56)

Shape derivatives Previous results (2-dim)

2-dim result

The perimeter, the volume

p(u) = P (Ω u ) = Z

S

1

√ u 2 + u 0 2

u 2 d θ, a(u) = | Ω u | = 1 2

Z

S

1

1 u 2 d θ

For any u 0 such that a ≤ 1/u 0 ≤ b, p 00 (u 0 )(v, v) ≥ α | v | 2 H

1

− β k v k 2 L

2

| a 00 (u 0 )(v, v) | ≤ β k v k 2 L

2

(57)

Shape derivatives Previous results (2-dim)

2-dim result

The perimeter, the volume

p(u) = P (Ω u ) = Z

S

1

√ u 2 + u 0 2

u 2 d θ, a(u) = | Ω u | = 1 2

Z

S

1

1 u 2 d θ For any u 0 such that a ≤ 1/u 0 ≤ b,

p 00 (u 0 )(v , v) ≥ α | v | 2 H

1

− β k v k 2 L

2

| a 00 (u 0 )(v, v) | ≤ β k v k 2 L

2

(58)

Shape derivatives Previous results (2-dim)

2-dim result

PDE functional

`(u) := λ 1 (Ω u ) Theorem (L., Novruzi, Pierre, 2011)

Let Ω u be convex in R 2 . Then for any ε > 0, there exist β such that

| ` 00 (u)(v, v) | ≤ β k v k 2

H

12

.

Applications :

(59)

Shape derivatives New results (N-dim)

Outline

1 Convexity constraint Old, new, open problems Case of concave functionals Applications

2 Shape derivatives

Previous results (2-dim)

New results (N-dim)

(60)

Shape derivatives New results (N-dim)

N-dim result

The perimeter, the volume

p(u) = Z

S

N−1

p u 2 + |∇ τ u | 2

u N d θ, m(u) = 1 N

Z

S

N−1

1 u N d θ,

For any u 0 such that a ≤ 1/u 0 ≤ b, p 00 (u 0 )(v, v) ≥ α | v | 2 H

1

− β k v k 2 L

2

| a 00 (u 0 )(v, v) | ≤ β k v k 2 L

2

(61)

Shape derivatives New results (N-dim)

N-dim result

The perimeter, the volume

p(u) = Z

S

N−1

p u 2 + |∇ τ u | 2

u N d θ, m(u) = 1 N

Z

S

N−1

1 u N d θ, For any u 0 such that a ≤ 1/u 0 ≤ b,

p 00 (u 0 )(v , v) ≥ α | v | 2 H

1

− β k v k 2 L

2

| a 00 (u 0 )(v, v) | ≤ β k v k 2 L

2

(62)

Shape derivatives New results (N-dim)

N-dim result

PDE functional, convex domains

`(u) := λ 1 (Ω u ) (for example)

Theorem (L., Novruzi, Pierre, 2015)

Let Ω u be semi-convex in R N (exterior ball condition). Then there exist β such that

| ` 00 (u)(v , v) | ≤ β k v k 2

H

12

.

Main tools for the proof :

New way to estimate shape derivative

W 1,p regularity theory for elliptic PDE in semi-convex domains (valid

for any p ∈ (1, ∞ )).

(63)

Shape derivatives New results (N-dim)

N-dim result

PDE functional, convex domains

`(u) := λ 1 (Ω u ) (for example)

Theorem (L., Novruzi, Pierre, 2015)

Let Ω u be semi-convex in R N (exterior ball condition). Then there exist β such that

| ` 00 (u)(v , v) | ≤ β k v k 2

H

12

. Main tools for the proof :

New way to estimate shape derivative

W 1,p regularity theory for elliptic PDE in semi-convex domains (valid

(64)

Shape derivatives New results (N-dim)

N-dim result

PDE functional, lipschitz domains

Theorem (L., Novruzi, Pierre, 2015)

Let Ω u be Lipschitz in R 2 . Then there exist β and ε > 0 such that

| ` 00 (u)(v , v) | ≤ β k v k 2 H

1−ε

.

Allows to deal with Exterior PDE problems

Estimate available in R N , but too weak to handle Example III

(P´ olya-Sz¨ ego)

(65)

Shape derivatives New results (N-dim)

N-dim result

PDE functional, lipschitz domains

Theorem (L., Novruzi, Pierre, 2015)

Let Ω u be Lipschitz in R 2 . Then there exist β and ε > 0 such that

| ` 00 (u)(v , v) | ≤ β k v k 2 H

1−ε

. Allows to deal with Exterior PDE problems

Estimate available in R N , but too weak to handle Example III

(P´ olya-Sz¨ ego)

(66)

Shape derivatives New results (N-dim)

N-dim result

PDE functional, lipschitz domains

Theorem (L., Novruzi, Pierre, 2015)

Let Ω u be Lipschitz in R 2 . Then there exist β and ε > 0 such that

| ` 00 (u)(v , v) | ≤ β k v k 2 H

1−ε

. Allows to deal with Exterior PDE problems

Estimate available in R N , but too weak to handle Example III

(P´ olya-Sz¨ ego)

(67)

Shape derivatives New results (N-dim)

Perspectives - More open problems

Reverse Faber-Krahn inequality

max { λ 1 (K ) / K convex ⊂ B(0, b), | K | = V 0 }

Polyhedra in dimension ≥ 3 ?

(68)

Shape derivatives New results (N-dim)

Perspectives - More open problems

Reverse Faber-Krahn inequality

max { λ 1 (K ) / K convex ⊂ B(0, b), | K | = V 0 }

Polyhedra in dimension ≥ 3 ?

Références

Documents relatifs

We establish existence results of Hartmann-Stampacchia type for a class of variational-hemivariational inequalities on closed and convex sets (either bounded or unbounded) in a

Dans la deuxième section de l’article ci-dessous, on tente de montrer de quelle manière cette propriété est liée à la théorie des modules galoisiens, plus précisément à

illustration purpose, see Figure 9.. Table 2: Parameters of mixture components corresponding to Fig. 9, used for the assessment of empirical levels of the test. The component

The expression for the shape derivative of the Wentzell eigenvalue Λ ∂Ω (Ω) has been obtained in [8] using the material derivative approach and then used to study the problem

We also recall the classical examples of second order shape derivatives, noticing in particular in which norms they are continuous (which leads to the value of s 2 from assumption (C

Our goal is, on one hand, to write down explicit first and second order optimality conditions for general 2-dimensional shape optimization problems with convexity con- straint and,

This structure allows us to define a useful notion of positivity of the shape derivative and we show it implies its continuity with respect to the uniform norm when the boundary

Our goal is, on one hand, to write down explicit first and second order optimality conditions for general 2-dimensional shape optimization problems with convexity constraint and, on