Preprint
Article

This version is not peer-reviewed.

Duality Principles and Numerical Procedures for a Large Class of Non-convex Models in the Calculus of Variations

Submitted:

19 June 2023

Posted:

19 June 2023

Read the latest preprint version here

Abstract
This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in the last section we present a concerning numerical example and the respective software.
Keywords: 
;  ;  

1. Introduction

In this section we establish a dual formulation for a large class of models in non-convex optimization.
The main duality principle is applied to double well models similar as those found in the phase transition theory.
Such results are based on the works of J.J. Telega and W.R. Bielski [2,3,15,16] and on a D.C. optimization approach developed in Toland [17].
About the other references, details on the Sobolev spaces involved are found in [1]. Related results on convex analysis and duality theory are addressed in [5,7,8,10,14].
Finally, in this text we adopt the standard Einstein convention of summing up repeated indices, unless otherwise indicated.
In order to clarify the notation, here we introduce the definition of topological dual space.
Definition 1.1 
(Topological dual spaces). Let U be a Banach space. We shall define its dual topological space, as the set of all linear continuous functionals defined on U. We suppose such a dual space of U, may be represented by another Banach space U * , through a bilinear form · , · U : U × U * R (here we are referring to standard representations of dual spaces of Sobolev and Lebesgue spaces). Thus, given f : U R linear and continuous, we assume the existence of a unique u * U * such that
f ( u ) = u , u * U , u U .
The norm of f , denoted by f U * , is defined as
f U * = sup u U { | u , u * U | : u U 1 } u * U * .
At this point we start to describe the primal and dual variational formulations.

2. A general duality principle non-convex optimization

In this section we present a duality principle applicable to a model in phase transition.
This case corresponds to the vectorial one in the calculus of variations.
Let Ω R n be an open, bounded, connected set with a regular (Lipschitzian) boundary denoted by Ω .
Consider a functional J : V R where
J ( u ) = F ( u 1 , , u N ) + G ( u 1 , , u N ) u i , f i L 2 ,
and where
V = { u = ( u 1 , , u N ) W 1 , p ( Ω ; R N ) : u = u 0 on Ω } ,
f L 2 ( Ω ; R N ) , and 1 < p < + .
We assume there exists α R such that
α = inf u V J ( u ) .
Moreover, suppose F and G are Fréchet differentiable but not necessarily convex. A global optimum point may not be attained for J so that the problem of finding a global minimum for J may not be a solution.
Anyway, one question remains, how the minimizing sequences behave close the infimum of J.
We intend to use duality theory to approximately solve such a global optimization problem.
Denoting V 0 = W 0 1 , p ( Ω ; R N ) , Y 1 = Y 1 * = L 2 ( Ω ; R N × n ) , Y 2 = Y 2 * = L 2 ( Ω ; R N × n ) , Y 3 = Y 3 * = L 2 ( Ω ; R N ) , at this point we define, F 1 : V × V 0 R , G 1 : V R , G 2 : V R , G 3 : V 0 R and G 4 : V R , by
F 1 ( u , ϕ ) = F ( u 1 + ϕ 1 , , u N + ϕ N ) + K 2 Ω u j · u j d x + K 2 2 Ω ϕ j · ϕ j d x
and
G 1 ( u 1 , , u n ) = G ( u 1 , , u N ) + K 1 2 Ω u j u j d x u i , f i L 2 ,
G 2 ( u 1 , , u N ) = K 1 2 Ω u j · u j d x ,
G 3 ( ϕ 1 , , ϕ N ) = K 2 2 Ω ϕ j · ϕ j d x ,
and
G 4 ( u 1 , , u N ) = K 1 2 Ω u j u j d x .
Define now J 1 : V × V 0 R ,
J 1 ( u , ϕ ) = F ( u + ϕ ) + G ( u ) u i , f i L 2 .
Observe that
J 1 ( u , ϕ ) = F 1 ( u , ϕ ) + G 1 ( u ) G 2 ( u ) G 3 ( ϕ ) G 4 ( u ) F 1 ( u , ϕ ) + G 1 ( u ) u , z 1 * L 2 ϕ , z 2 * L 2 u , z 3 * L 2 + sup v 1 Y 1 { v 1 , z 1 * L 2 G 2 ( v 1 ) } + sup v 2 Y 2 { v 2 , z 2 * L 2 G 3 ( v 2 ) } + sup u V { u , z 3 * L 2 G 4 ( u ) } = F 1 ( u , ϕ ) + G 1 ( u ) u , z 1 * L 2 ϕ , z 2 * L 2 u , z 3 * L 2 + G 2 * ( z 1 * ) + G 3 * ( z 2 * ) + G 4 * ( z 3 * ) = J 1 * ( u , ϕ , z * ) ,
u V , ϕ V 0 , z * = ( z 1 * , z 2 * , z 3 * ) Y * = Y 1 * × Y 2 * × Y 3 * .
Here we assume K , K 1 , K 2 are large enough so that F 1 and G 1 are convex.
Hence, from the general results in [17], we may infer that
inf ( u , ϕ ) V × V 0 J ( u , ϕ ) = inf ( u , ϕ , z * ) V × V 0 × Y * J 1 * ( u , ϕ , z * ) .
On the other hand
inf u V J ( u ) inf ( u , ϕ ) V × V 0 J 1 ( u , ϕ ) inf u V Q J ( u ) = inf u V J ( u ) ,
where Q J ( u ) refers to a standard quasi-convex regularization of J.
From these last two results we may obtain
inf u V J ( u ) = inf ( u , ϕ , z * ) V × V 0 × Y * J 1 * ( u , ϕ , z * ) .
Moreover, from standards results on convex analysis, we may have
inf u V J 1 * ( u , ϕ , z * ) = inf u V { F 1 ( u , ϕ ) + G 1 ( u ) u , z 1 * L 2 ϕ , z 2 * L 2 u , z 3 * L 2 + G 2 * ( z 1 * ) + G 3 * ( z 2 * ) + G 4 * ( z 3 * ) } = sup ( v 1 * , v 2 * ) C * { F 1 * ( v 1 * + z 1 * , ϕ ) G 1 * ( v 2 * + z 3 * ) ϕ , z 2 * L 2 + G 2 * ( z 1 * ) + G 3 * ( z 2 * ) + G 4 * ( z 3 * ) } ,
where
C * = { v * = ( v 1 * , v 2 * ) Y 1 * × Y 3 * : div ( v 1 * ) i + ( v 2 * ) i = 0 , i { 1 , , N } } ,
F 1 * ( v 1 * + z 1 * , ϕ ) = sup v 1 Y 1 { v 1 , z 1 * + v 1 * L 2 F 1 ( v 1 , ϕ ) } ,
and
G 1 * ( v 2 * + z 2 * ) = sup u V { u , v 2 * + z 2 * L 2 G 1 ( u ) } .
Thus, defining
J 2 * ( ϕ , z * , v * ) = F 1 * ( v 1 * + z 1 * , ϕ ) G 1 * ( v 2 * + z 3 * ) ϕ , z 2 * L 2 + G 2 * ( z 1 * ) + G 3 * ( z 2 * ) + G 4 * ( z 3 * ) ,
we have got
inf u V J ( u ) = inf ( u , ϕ ) V × V 0 J 1 ( u , ϕ ) = inf ( u , ϕ , z * ) V × V 0 × Y * J 1 * ( u , ϕ , z * ) = inf z * Y * inf ϕ V 0 sup v * C * J 2 * ( ϕ , z * , v * ) .
Finally, observe that
inf u V J ( u ) = inf z * Y * inf ϕ V 0 sup v * C * J 2 * ( ϕ , z * , v * ) sup v * C * inf ( z * , ϕ ) Y * × V 0 J 2 * ( ϕ , z * , v * ) .
This last variational formulation corresponds to a concave relaxed formulation in v * concerning the original primal formulation.

4. A convex dual variational formulation for a third similar model

In this section we present another duality principle for a third related model in phase transition.
Let Ω = [ 0 , 1 ] R and consider a functional J : V R where
J ( u ) = 1 2 Ω min { ( u 1 ) 2 , ( u + 1 ) 2 } d x + 1 2 Ω u 2 d x u , f L 2 ,
and where
V = { u W 1 , 2 ( Ω ) : u ( 0 ) = 0 and u ( 1 ) = 1 / 2 }
and f L 2 ( Ω ) .
A global optimum point is not attained for J so that the problem of finding a global minimum for J has no solution.
Anyway, one question remains, how the minimizing sequences behave close to the infimum of J.
We intend to use the duality theory to solve such a global optimization problem in an appropriate sense to be specified.
At this point we define, F : V R and G : V R by
F ( u ) = 1 2 Ω min { ( u 1 ) 2 , ( u + 1 ) 2 } d x = 1 2 Ω ( u ) 2 d x Ω | u | d x + 1 / 2 F 1 ( u ) ,
and
G ( u ) = 1 2 Ω u 2 d x u , f L 2 .
Denoting Y = Y * = L 2 ( Ω ) we also define the polar functional F 1 * : Y * R and G * : Y * R by
F 1 * ( v * ) = sup v Y { v , v * L 2 F 1 ( v ) } = 1 2 Ω ( v * ) 2 d x + Ω | v * | d x ,
and
G * ( ( v * ) ) = sup u V { u , v * L 2 G ( u ) } = 1 2 Ω ( ( v * ) + f ) 2 d x 1 2 v * ( 1 ) .
Observe this is the scalar case of the calculus of variations, so that from the standard results on convex analysis, we have
inf u V J ( u ) = max v * Y * { F 1 * ( v * ) G * ( ( v * ) ) } .
Indeed, from the direct method of the calculus of variations, the maximum for the dual formulation is attained at some v ^ * Y * .
Moreover, the corresponding solution u 0 V is obtained from the equation
u 0 = G ( ( v ^ * ) ) ( v * ) = ( v ^ * ) + f .
Finally, the Euler-Lagrange equations for the dual problem stands for
( v * ) + f v * sign ( v * ) = 0 , in Ω , ( v * ) ( 0 ) = 0 , ( v * ) ( 1 ) = 1 / 2 ,
where sign ( v * ( x ) ) = 1 if v * ( x ) > 0 , sign ( v * ( x ) ) = 1 , if v * ( x ) < 0 and
1 sign ( v * ( x ) ) 1 ,
if v * ( x ) = 0 .
We have computed the solutions v * and corresponding solutions u 0 V for the cases in which f ( x ) = 0 and f ( x ) = sin ( π x ) / 2 .
For the solution u 0 ( x ) for the case in which f ( x ) = 0 , please see Figure 3.
For the solution u 0 ( x ) for the case in which f ( x ) = sin ( π x ) / 2 , please see Figure 4.
Remark 4.1. 
Observe that such solutions u 0 obtained are not the global solutions for the related primal optimization problems. Indeed, such solutions reflect the average behavior of weak cluster points for concerning minimizing sequences.

4.1. The algorithm through which we have obtained the numerical results

In this subsection we present the software in MATLAB through which we have obtained the last numerical results.
This algorithm is for solving the concerning Euler-Lagrange equations for the dual problem, that is, for solving the equation
( v * ) + f v * sign ( v * ) = 0 , in Ω , ( v * ) ( 0 ) = 0 , ( v * ) ( 1 ) = 1 / 2 .
Here the concerning software in MATLAB. We emphasize to have used the smooth approximation
| v * | ( v * ) 2 + e 1 ,
where a small value for e 1 is specified in the next lines.
*************************************
1.
clear all
2.
m 8 = 800 ; (number of nodes)
3.
d = 1 / m 8 ;
4.
e 1 = 0.00001 ;
5.
f o r i = 1 : m 8
y o ( i , 1 ) = 0.01 ;
y 1 ( i , 1 ) = sin ( π * i / m 8 ) / 2 ;
e n d ;
6.
f o r i = 1 : m 8 1
d y 1 ( i , 1 ) = ( y 1 ( i + 1 , 1 ) y 1 ( i , 1 ) ) / d ;
e n d ;
7.
f o r k = 1 : 3000 (we have fixed the number of iterations)
i = 1 ;
h 3 = 1 / v o ( i , 1 ) 2 + e 1 ;
m 12 = 1 + d 2 * h 3 + d 2 ;
m 50 ( i ) = 1 / m 12 ;
z ( i ) = m 50 ( i ) * ( d y 1 ( i , 1 ) * d 2 ) ;
8.
f o r i = 2 : m 8 1
h 3 = 1 / v o ( i , 1 ) 2 + e 1 ;
m 12 = 2 + h 3 * d 2 + d 2 m 50 ( i 1 ) ;
m 50 ( i ) = 1 / m 12 ;
z ( i ) = m 50 ( i ) * ( z ( i 1 ) + d y 1 ( i , 1 ) * d 2 ) ;
e n d ;
9.
v ( m 8 , 1 ) = ( d / 2 + z ( m 8 1 ) ) / ( 1 m 50 ( m 8 1 ) ) ;
10.
f o r i = 1 : m 8 1
v ( m 8 i , 1 ) = m 50 ( m 8 i ) * v ( m 8 i + 1 ) + z ( m 8 i ) ;
e n d ;
11.
v ( m 8 / 2 , 1 )
12.
v o = v ;
e n d ;
13.
f o r i = 1 : m 8 1
u ( i , 1 ) = ( v ( i + 1 , 1 ) v ( i , 1 ) ) / d + y 1 ( i , 1 ) ;
e n d ;
14.
f o r i = 1 : m 8 1
x ( i ) = i * d ;
e n d ;
p l o t ( x , u ( : , 1 ) )
********************************

6. An exact convex dual variational formulation for a non-convex primal one

In this section we develop a convex dual variational formulation suitable to compute a critical point for the corresponding primal one.
Let Ω R 2 be an open, bounded, connected set with a regular (Lipschitzian) boundary denoted by Ω .
Consider a functional J : V R where
J ( u ) = F ( u x , u y ) u , f L 2 ,
V = W 0 1 , 2 ( Ω ) and f L 2 ( Ω ) .
Here we denote Y = Y * = L 2 ( Ω ) and Y 1 = Y 1 * = L 2 ( Ω ) × L 2 ( Ω ) .
Defining
V 1 = { u V : u 1 , K 1 }
for some appropriate K 1 > 0 , suppose also F is twice Fréchet differentiable and
det 2 F ( u x , u y ) v 1 v 2 0 ,
u V 1 .
Define now F 1 : V R and F 2 : V R by
F 1 ( u x , u y ) = F ( u x , u y ) + ε 2 Ω u x 2 d x + ε 2 Ω u y 2 d x ,
and
F 2 ( u x , u y ) = ε 2 Ω u x 2 d x + ε 2 Ω u y 2 d x ,
where here we denote d x = d x 1 d x 2 .
Moreover, we define the respective Legendre transform functionals F 1 * and F 2 * as
F 1 * ( v * ) = v 1 , v 1 * L 2 + v 2 , v 2 * L 2 F 1 ( v 1 , v 2 ) ,
where v 1 , v 2 Y are such that
v 1 * = F 1 ( v 1 , v 2 ) v 1 ,
v 2 * = F 1 ( v 1 , v 2 ) v 2 ,
and
F 2 * ( v * ) = v 1 , v 1 * + f 1 L 2 + v 2 , v 2 * L 2 F 2 ( v 1 , v 2 ) ,
where v 1 , v 2 Y are such that
v 1 * + f 1 = F 2 ( v 1 , v 2 ) v 1 ,
v 2 * = F 2 ( v 1 , v 2 ) v 2 .
Here f 1 is any function such that
( f 1 ) x = f , in Ω .
Furthermore, we define
J * ( v * ) = F 1 * ( v * ) + F 2 * ( v * ) = F 1 * ( v * ) + 1 2 ε Ω ( v 1 * + f 1 ) 2 d x + 1 2 ε Ω ( v 2 * ) 2 d x .
Observe that through the target conditions
v 1 * + f 1 = ε u x ,
v 2 * = ε u y ,
we may obtain the compatibility condition
( v 1 * + f 1 ) y ( v 2 * ) x = 0 .
Define now
A * = { v * = ( v 1 * , v 2 * ) B r ( 0 , 0 ) Y 1 * : ( v 1 * + f 1 ) y ( v 2 * ) x = 0 , in Ω } ,
for some appropriate r > 0 such that J * is convex in B r ( 0 , 0 ) .
Consider the problem of minimizing J * subject to v * A * .
Assuming r > 0 is large enough so that the restriction in r is not active, at this point we define the associated Lagrangian
J 1 * ( v * , φ ) = J * ( v * ) + φ , ( v 1 * + f ) y ( v 2 * ) x L 2 ,
where φ is an appropriate Lagrange multiplier.
Therefore
J 1 * ( v * ) = F 1 * ( v * ) + 1 2 ε Ω ( v 1 * + f 1 ) 2 d x + 1 2 ε Ω ( v 2 * ) 2 d x + φ , ( v 1 * + f ) y ( v 2 * ) x L 2 .
The optimal point in question will be a solution of the corresponding Euler-Lagrange equations for J 1 * .
From the variation of J 1 * in v 1 * we obtain
F 1 * ( v * ) v 1 * + v 1 * + f ε φ y = 0 .
From the variation of J 1 * in v 2 * we obtain
F 1 * ( v * ) v 2 * + v 2 * ε + φ x = 0 .
From the variation of J 1 * in φ we have
( v 1 * + f ) y ( v 2 * ) x = 0 .
From this last equation, we may obtain u V such that
v 1 * + f = ε u x ,
and
v 2 * = ε u y .
From this and the previous extremal equations indicated we have
F 1 * ( v * ) v 1 * + u x φ y = 0 ,
and
F 1 * ( v * ) v 2 * + u y + φ x = 0 .
so that
v 1 * + f = F 1 ( u x φ y , u y + φ x ) v 1 ,
and
v 2 * = F 1 ( u x φ y , u y + φ x ) v 2 .
From this and Equations (25) and (26) we have
ε F 1 * ( v * ) v 1 * x ε F 1 * ( v * ) v 2 * y + ( v 1 * + f 1 ) x + ( v 2 * ) y = ε u x x ε u y y + ( v 1 * ) x + ( v 2 * ) y + f = 0 .
Replacing the expressions of v 1 * and v 2 * into this last equation, we have
ε u x x ε u y y + F 1 ( u x φ y , u y + φ x ) v 1 x + F 1 ( u x φ y , u y + φ x ) v 2 y + f = 0 ,
so that
F ( u x φ y , u y + φ x ) v 1 x + F ( u x φ y , u y + φ x ) v 2 y + f = 0 , in Ω .
Observe that if
2 φ = 0
then there exists u ^ such that u and φ are also such that
u x φ y = u ^ x
and
u y + φ x = u ^ y .
The boundary conditions for φ must be such that u ^ W 0 1 , 2 .
From this and Equation (28) we obtain
δ J ( u ^ ) = 0 .
Summarizing, we may obtain a solution u ^ W 0 1 , 2 of equation δ J ( u ^ ) = 0 by minimizing J * on A * .
Finally, observe that clearly J * is convex in an appropriate large ball B r ( 0 , 0 ) for some appropriate r > 0

10. A duality principle for a general vectorial case in the calculus of variations

In this section we develop a duality principle for a general vectorial case in variational optimization.
Let Ω R 3 be an open, bounded and connected set with a regular (Lipschitzian) boundary denoted by Ω . Let J : V R be a functional where
J ( u ) = G ( u 1 , , u N ) u , f L 2 ,
where
V = W 0 1 , 2 ( Ω ; R N )
and
f = ( f 1 , , f N ) L 2 ( Ω ; R N ) .
Here we have denoted u = ( u 1 , , u N ) V and
u , f L 2 = u i , f i L 2 ,
so that we may also denote
J ( u ) = G ( u ) u , f L 2 .
Assume
G ( u ) = Ω g ( u ) d x
where g : R 3 N R is a differentiable function such that
g ( y ) +
as | y | . Moreover, suppose there exists α R such that
α = inf u V J ( u ) .
It is well known that
α = inf u V J ( u ) = inf u V J * * ( u ) = inf u V { ( G ) * * ( u ) u , f L 2 } .
Under some mild hypotheses, from convexity, we have that
inf u V { ( G ) * * ( u ) u , f L 2 } = sup v * A * { ( G ) * ( d i v v * ) } = ( G ) * ( f ) ,
where
A * = { v * Y = Y * = L 2 ( Ω ; R 3 N ) : d i v v * + f = 0 } .
Now observe that the restriction v = u for some u V is equivalent to the restriction
curl v i = 0 , in Ω
where v = { v i } = { v i j } j = 1 3 , i { 1 , , N } , with appropriate boundary conditions, so that with an appropriate Lagrange multiplier ϕ = { ϕ i } , we obtain
( G ) * ( d i v v * ) = sup u V { u , d i v v * L 2 G ( u ) } = sup u V { u , v * L 2 G ( u ) } inf ϕ Y * sup v Y { v , v * L 2 G ( v ) + ϕ , curl v L 2 = inf ϕ Y * G * ( v * + curl ϕ ) .
where we have denoted
curl v = { curl v i }
and
curl ϕ = { curl ϕ i } .
Joining the pieces, we have got
inf u V J ( u ) = inf u V { G ( u ) u , f L 2 } sup ( v * , ϕ ) A * × Y * { G * ( v * + curl ϕ ) } ,
where we recall that Y = Y * = L 2 ( Ω ; R 3 N ) .
We emphasize such a dual formulation in ( v * , ϕ ) is convex (in fact concave).

11. A note on the Galerkin Functional

Let Ω R 3 be an open, bounded and connected set with a regular (Lipschitzian) boundary denoted by Ω .
Consider the functional J : V R where
J ( u ) = γ 2 Ω u · u d x + α 4 Ω u 4 d x β 2 Ω u 2 d x u , f L 2
Here V = W 0 1 , 2 ( Ω ) , γ > 0 , α > 0 , β > 0 .
We denote also
Y = Y * = L 2 ( Ω ) .
At this point we define
A + = { u V : u f 0 , in Ω } ,
V 2 = { u V : u K 3 } ,
for some appropriate real constant K 3 > 0 and
V 1 = A + V 2 .
Observe that
J ( u ) = γ 2 u + α u 3 β f ,
so that we define the Galerkin functional J 1 : V R by
J 1 ( u ) = 1 2 J ( u ) 2 2 = 1 2 Ω ( γ 2 u + α u 3 β u f ) 2 d x .
From this, we get
2 J 1 ( u ) u 2 = ( γ u + α u 3 β u f ) 6 α u + ( γ 2 + 3 α u 2 β ) 2 .
Define now
φ 2 = ( γ 2 u + α u 3 β u f ) 6 α u .
At this point, for an appropriate small real constant ε 1 > 0 and bounded constant operator M 1 > ε 1 , we set the intended non-active restriction
3 α | u | | M 1 + γ 2 + β | ,
and define
B 1 = { u V 1 : 3 α | u | | M 1 + γ 2 + β | } .
Observe that since for u V 1 we have u f 0 in Ω so that if u 1 , u 2 V 1 then
sign ( u 1 ) = sign ( u 2 ) , in Ω ,
we may infer that B 1 is a convex set.
Furthermore, if u B 1 , then
3 α | u | | M 1 + γ 2 + β | ,
so that
3 α u 2 M 1 + γ 2 + β ,
and hence
δ 2 J ( u ) = γ 2 + 3 α u 2 β M 1 > ε 1 > 0 .
For a small parameter ε > 0 we define the intended non-active restriction
φ 2 ε u 2 , in Ω ,
and define
B 2 = { u V 1 : φ 2 ε u 2 , in Ω .
Observe that
φ 2 ε u 2 ,
is equivalent to
K 7 u 2 φ 2 ε u 2 + K 7 u 2 ,
which is equivalent to
K 7 u 2 max { 0 , φ 2 } ε u 2 + K 7 u 2 , in Ω .
This last inequality is equivalent to
K 7 | u | max { 0 , φ 2 } ε u 2 + K 7 u 2 ,
that is,
max { 0 , φ 2 } ε u 2 + K 7 u 2 K 7 | u | 0 , in Ω .
Observe now that for K 7 > 0 sufficiently large, we have that the function
max { 0 , φ 2 } ε u 2 + K 7 u 2
is convex on V 1 .
Moreover, if u V 1 , we have
u f 0 , in Ω ,
so that similarly as above indicated, we may infer that
K 7 | u |
is a convex function on V 1 .
Summarizing
max { 0 , φ 2 } ε u 2 + K 7 u 2 K 7 | u |
is a convex function on V 1 so that B 2 is a convex set.
Assuming 0 < ε ε 1 1 , define B 3 = B 1 B 2 , which is a convex set.
Summarizing, if u B 3 , then
δ 2 J 1 ( u ) 0 .
With such results in mind, we define the following convex optimization problem for finding a critical point of J.
Minimize
J 1 ( u ) = 1 2 J ( u ) 2 2 = 1 2 Ω ( γ 2 u + α u 3 β u f ) 2 d x ,
subject to
u B 3 .
Observe that a critical point u 0 B 3 of J 1 , from such a concerning convexity of J 1 on the convex set B 1 , is also such that
J ( u 0 ) = min u B 3 J 1 ( u ) .
Finally, we may also define the convex optimization problem of minimizing
J 3 ( u ) = K 1 J 1 ( u ) + J ( u ) = K 1 2 Ω ( γ 2 u + α u 3 β u f ) 2 d x + γ 2 Ω u · u d x + α 4 Ω u 4 d x β 2 Ω u 2 d x u , f L 2 ,
subject to
u B 3 .
Here K 1 > 0 is a large real constant.
Such a functional J 3 is also convex on B 3 so that a critical point u 0 B 3 of J is also a critical point of J 3 , and thus
J 3 ( u 0 ) = min u B 3 J 3 ( u ) .

12. A note on the Legendre-Galerkin functional

Let Ω R 3 be an open, bounded and connected set with a regular (Lipschitzian) boundary denoted by Ω .
Consider the functional J : V R where
J ( u ) = γ 2 Ω u · u d x + α 4 Ω u 4 d x β 2 Ω u 2 d x u , f L 2
Here V = W 0 1 , 2 ( Ω ) , γ > 0 , α > 0 , β > 0 .
We denote also
Y = Y * = L 2 ( Ω )
and F 1 : V R , F 2 : V R and F 3 : V R by
F 1 ( u ) = γ 2 Ω u · u d x ,
F 2 ( u ) = α 4 Ω u 4 d x ,
F 3 ( u ) = β 2 Ω u 2 d x .
Moreover, we define F 1 * , F 2 * , F 3 * : Y * R by
F 1 * ( v 1 * ) = sup u V { u , v 1 * L 2 F 1 ( u ) } = 1 2 Ω ( v 1 * ) 2 γ 2 d x ,
F 2 * ( v 2 * ) = sup u V { u , v 2 * L 2 F 2 ( u ) } = 3 4 Ω ( v 2 * ) 4 / 3 α 1 / 3 d x ,
F 3 * ( v 3 * ) = sup u V { u , v 3 * L 2 F 3 ( u ) } = 1 2 β Ω ( v 3 * ) 2 d x .
Observe now that these three last suprema are attained through the equations,
v 1 * = F 1 ( u ) u = γ 2 u ,
v 2 * = F 2 ( u ) u = α u 3
v 3 * = F 3 ( u ) u = β u .
From such results, at a critical point, we obtain the following compatibility conditions
u = v 1 * γ 2 = v 2 * β 1 / 3 = v 3 * β .
From such relations we have
v 1 * γ 2 = v 3 * β ,
and
v 2 * = α v 3 * β 3 ,
so that
v 1 * = γ 2 v 3 * β ,
and
v 2 * = α v 3 * β 3 .
Moreover, we define the functional F 4 * : Y * R , by
F 4 * ( v * ) = sup u V { u , v 1 * + v 2 * v 3 * L 2 u , f L 2 } .
Therefore
F 4 * ( v * ) = 0 , if v 1 * + v 2 * v 3 * f = 0 , in Ω , + , otherwise .
Hence, a critical point of J corresponds to the solution of the following system of equations
v 1 * = γ 2 v 3 * β ,
v 2 * = α v 3 * β 3 ,
and
v 1 * + v 2 * v 3 * f = 0 , in Ω .
From this last equation we may obtain
v 1 * = v 2 * + v 3 * + f ,
so that the final equations to be solved are
v 2 * + v 3 * + f + γ 2 v 3 * β = 0
and
v 2 * α v 3 * β 3 = 0 , in Ω ,
with the boundary conditions
u = v 3 * β = 0 , on Ω .
With such results in mind, we define the Legendre-Galerkin functional J * : [ Y * ] 2 R , where
J * ( v * ) = 1 2 Ω v 2 * + v 3 * + f + γ 2 v 3 * β 2 d x + 1 2 Ω v 2 * α v 3 * β 3 2 d x .
At this point, defining
φ = v 2 * α v 3 * β 3 ,
we obtain
2 J * ( v * ) ( v 2 * ) 2 = 2 ;
2 J * ( v * ) ( v 3 * ) 2 = 1 γ 2 β 2 + 9 α 2 ( v 3 * ) 4 β 6 + O ( φ ) ,
2 J * ( v * ) v 2 * v 3 * = 3 α ( v 3 * ) 2 β 3 + 1 γ 2 β .
From such results we may infer that
det 2 J * ( v * ) v 2 * v 3 * = 2 J * ( v * ) ( v 2 * ) 2 2 J * ( v * ) ( v 3 * ) 2 2 J * ( v * ) v 2 * v 3 * 2 = 1 γ 2 β + 3 α ( v 3 * ) 2 β 3 2 + O ( φ )
Observe that a critical point φ = 0 so that δ 2 J * ( v * ) > 0 at a neighborhood of any critical point.
At this point we define
A + = v * = ( v 2 * , v 3 * ) [ Y * ] 2 : v 3 * β f 0 , in Ω ,
D * = { v * = ( v 2 * , v 3 * ) [ Y * ] 2 : v * K } ,
for an appropriate real constant K > 0 .
Finally, for an appropriate finite dimensional model version, in a finite differences or finite elements context, we assume
γ 2 β < 0 ,
and define E * = A + D * .
We also define
C 1 * = { v * = ( v 2 * , v 3 * ) E * : φ 2 ε , in Ω } ,
for a small real constant ε > 0 ,
C 2 * = v * = ( v 2 * , v 3 * ) E * : 1 γ 2 β + 3 α ( v 3 * ) 2 β 3 ε 1 ,
and
C * = C 1 * C 2 * .
Similarly as in the in the book [6], in Chapter 8, at section 8.7, in the proof of Theorem 8.7.1 at pages 299, 300 and 301, we may prove that C * is a convex set.
Furthermore, for 0 < ε ε 1 1 , we have that J * is convex on C * .
Summarizing, we may define the following convex optimization problem to obtain a critical point of the primal functional J,
Minimize J * ( v 2 * , v 3 * ) subject to v * = ( v 2 * , v 3 * ) C * .
We call J * the Legendre-Galerkin functional associated to J.

12.1. Numerical examples

We have obtained numerical solutions for two one-dimensional examples.
1.
For γ = 1.0 , α = 3.0 , β = 30.0 , f 10 , in Ω = [ 0 , 1 ] .
For the respective solution please see Figure 7.
2.
For γ = 0.01 , α = 3.0 , β = 30.0 , f 10 , in Ω = [ 0 , 1 ] .
For the respective solution please see Figure 8.

References

  1. R.A. Adams and J.F. Fournier. Sobolev Spaces, 2nd ed.; Elsevier: New York, NY, USA, 2003. [Google Scholar]
  2. W.R. Bielski, A. W.R. Bielski, A. Galka, J.J. Telega, The Complementary Energy Principle and Duality for Geometrically Nonlinear Elastic Shells. I. Simple case of moderate rotations around a tangent to the middle surface. Bulletin of the Polish Academy of Sciences, Technical Sciences, Vol. 38, No. 7-9, 1988.
  3. W.R. Bielski and J.J. Telega, A Contribution to Contact Problems for a Class of Solids and Structures, Arch. Mech., 37, 4-5, pp. 303-320, Warszawa 1985.
  4. J.F. Annet, Superconductivity, Superfluids and Condensates, 2nd edn. (Oxford Master Series in Condensed Matter Physics, Oxford University Press, Reprint). 2010.
  5. F.S. Botelho, Functional Analysis, Calculus of Variations and Numerical Methods in Physics and Engineering, CRC Taylor and Francis, Florida, 2020.
  6. F.S. Botelho, Advanced Calculus and its Applications in Variational Quantum Mechanics and Relativity Theory, CRC Taylor and Francis, Florida, 2021.
  7. F.S. Botelho, Variational Convex Analysis, Ph.D. thesis, Virginia Tech, Blacksburg, VA -USA, (2009).
  8. F. Botelho, Topics on Functional Analysis, Calculus of Variations and Duality, Academic Publications, Sofia, (2011).
  9. F. Botelho, Existence of solution for the Ginzburg-Landau system, a related optimal control problem and its computation by the generalized method of lines, Applied Mathematics and Computation, 218, 11976-11989, (2012). [CrossRef]
  10. F. Botelho, Functional Analysis and Applied Optimization in Banach Spaces, Springer Switzerland, 2014.
  11. P.Ciarlet, Mathematical Elasticity, Vol. II – Theory of Plates, North Holland Elsevier (1997).
  12. J.C. Strikwerda, Finite Difference Schemes and Partial Differential Equations, SIAM, second edition (Philadelphia, 2004).
  13. L.D. Landau and E.M. Lifschits, Course of Theoretical Physics, Vol. 5- Statistical Physics, part 1. (Butterworth-Heinemann, Elsevier, reprint 2008).
  14. R.T. Rockafellar, Convex Analysis, Princeton Univ. Press, (1970).
  15. J.J. Telega, On the complementary energy principle in non-linear elasticity. Part I: Von Karman plates and three dimensional solids, C.R. Acad. Sci. Paris, Serie II, 308, 1193-1198; Part II: Linear elastic solid and non-convex boundary condition. Minimax approach, ibid, pp. 1313.
  16. A.Galka and J.J.Telega Duality and the complementary energy principle for a class of geometrically non-linear structures. Part I. Five parameter shell model; Part II. Anomalous dual variational priciples for compressed elastic beams. Arch. Mech. 1995, 677-698, 699–724.
  17. J.F. Toland, A duality principle for non-convex optimisation and the calculus of variations, Arch. Rat. Mech. Anal., 71, No. 1 (1979), 41-61. [CrossRef]
Figure 1. Solution u 0 ( x ) for the case f ( x ) = 0 .
Figure 1. Solution u 0 ( x ) for the case f ( x ) = 0 .
Preprints 76983 g001
Figure 2. Solution u 0 ( x ) for the case f ( x ) = sin ( π x ) / 2 .
Figure 2. Solution u 0 ( x ) for the case f ( x ) = sin ( π x ) / 2 .
Preprints 76983 g002
Figure 3. Solution u 0 ( x ) for the case f ( x ) = 0 .
Figure 3. Solution u 0 ( x ) for the case f ( x ) = 0 .
Preprints 76983 g003
Figure 4. Solution u 0 ( x ) for the case f ( x ) = sin ( π x ) / 2 .
Figure 4. Solution u 0 ( x ) for the case f ( x ) = sin ( π x ) / 2 .
Preprints 76983 g004
Figure 5. Density t ( x , y ) for the Case A.
Figure 5. Density t ( x , y ) for the Case A.
Preprints 76983 g005
Figure 6. Density t ( x , y ) for the Case B.
Figure 6. Density t ( x , y ) for the Case B.
Preprints 76983 g006
Figure 7. Solution u ( x ) = v 3 ( x ) / β for the example 1.
Figure 7. Solution u ( x ) = v 3 ( x ) / β for the example 1.
Preprints 76983 g007
Figure 8. Solution u ( x ) = v 3 ( x ) / β for the example 2.
Figure 8. Solution u ( x ) = v 3 ( x ) / β for the example 2.
Preprints 76983 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated