Submitted:
29 June 2023
Posted:
29 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:
Duality theory
; non-convex analysis
; numerical method for a non-smooth model
MSC: 49N15
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 , through a bilinear form (here we are referring to standard representations of dual spaces of Sobolev and Lebesgue spaces). Thus, given linear and continuous, we assume the existence of a unique such that
The norm of f , denoted by , is defined as
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 be an open, bounded, connected set with a regular (Lipschitzian) boundary denoted by
Consider a functional where
and where
and
We assume there exists such that
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 , , , at this point we define, , , , and by
and
and
Define now ,
Observe that
.
Here we assume are large enough so that and are convex.
Hence, from the general results in [17], we may infer that
On the other hand
where refers to a standard quasi-convex regularization of J.
From these last two results we may obtain
Moreover, from standards results on convex analysis, we may have
where
and
Thus, defining
we have got
Finally, observe that
This last variational formulation corresponds to a concave relaxed formulation in 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 and consider a functional where
and where
and
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, and by
and
Denoting we also define the polar functional and by
and
Observe this is the scalar case of the calculus of variations, so that from the standard results on convex analysis, we have
Indeed, from the direct method of the calculus of variations, the maximum for the dual formulation is attained at some .
Moreover, the corresponding solution is obtained from the equation
Finally, the Euler-Lagrange equations for the dual problem stands for
where if if and
if
We have computed the solutions and corresponding solutions for the cases in which and
For the solution for the case in which , please see Figure 3.
For the solution for the case in which , please see Figure 4.
Remark 4.1.
Observe that such solutions 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
Here the concerning software in MATLAB. We emphasize to have used the smooth approximation
where a small value for is specified in the next lines.
*************************************
- clear all
- (number of nodes)
-
(we have fixed the number of iterations)
********************************
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 be an open, bounded, connected set with a regular (Lipschitzian) boundary denoted by
Consider a functional where
and
Here we denote and
Defining
for some appropriate , suppose also F is twice Fréchet differentiable and
Define now and by
and
where here we denote
Moreover, we define the respective Legendre transform functionals and as
where are such that
and
where are such that
Here is any function such that
Furthermore, we define
Observe that through the target conditions
we may obtain the compatibility condition
Define now
for some appropriate such that is convex in
Consider the problem of minimizing subject to
Assuming is large enough so that the restriction in r is not active, at this point we define the associated Lagrangian
where is an appropriate Lagrange multiplier.
Therefore
The optimal point in question will be a solution of the corresponding Euler-Lagrange equations for
From the variation of in we obtain
From the variation of in we obtain
From the variation of in we have
From this last equation, we may obtain such that
and
From this and the previous extremal equations indicated we have
and
so that
and
Replacing the expressions of and into this last equation, we have
so that
Observe that if
then there exists such that u and are also such that
and
The boundary conditions for must be such that
From this and equation (28) we obtain
Summarizing, we may obtain a solution of equation by minimizing on .
Finally, observe that clearly is convex in an appropriate large ball for some appropriate
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 be an open, bounded and connected set with a regular (Lipschitzian) boundary denoted by . Let be a functional where
where
and
Here we have denoted and
so that we may also denote
Assume
where is a differentiable function such that
as . Moreover, suppose there exists such that
It is well known that
Under some mild hypotheses, from convexity, we have that
where
Now observe that the restriction for some is equivalent to the restriction
where , with appropriate boundary conditions, so that with an appropriate Lagrange multiplier , we obtain
where we have denoted
and
Joining the pieces, we have got
where we recall that
We emphasize such a dual formulation in is convex (in fact concave).
11. A note on the Galerkin Functional
Let be an open, bounded and connected set with a regular (Lipschitzian) boundary denoted by .
Consider the functional where
Here ,
We denote also
At this point we define
for some appropriate real constant and
Observe that
so that we define the Galerkin functional by
From this, we get
Define now
At this point, for an appropriate small real constant and bounded constant operator , we set the intended non-active restriction
and define
Observe that since for we have in so that if then
we may infer that is a convex set.
Furthermore, if , then
so that
and hence
For a small parameter we define the intended non-active restriction
and define
Observe that for and sufficiently large is convex in (positive definite Hessian) so that is a convex set. Assuming , define , which is a convex set.
Summarizing, if , then
With such results in mind, we define the following convex optimization problem for finding a critical point of J.
Minimize
subject to
Observe that a critical point of , from such a concerning convexity of on the convex set , is also such that
Finally, we may also define the convex optimization problem of minimizing
subject to
Here is a large real constant.
Such a functional is also convex on so that a critical point of J is also a critical point of , and thus
12. A note on the Legendre-Galerkin functional
Let be an open, bounded and connected set with a regular (Lipschitzian) boundary denoted by .
Consider the functional where
Here ,
We denote also
and , and by
Moreover, we define by
Observe now that these three last suprema are attained through the equations,
From such results, at a critical point, we obtain the following compatibility conditions
From such relations we have
and
so that
and
Moreover, we define the functional by
Therefore
Hence, a critical point of J corresponds to the solution of the following system of equations
and
From this last equation we may obtain
so that the final equations to be solved are
and
with the boundary conditions
With such results in mind, we define the Legendre-Galerkin functional , where
At this point, defining
we obtain
From such results we may infer that
Observe that a critical point so that at a neighborhood of any critical point.
At this point we define
for an appropriate real constant .
Define now ,
for a small real constant
and
Similarly as done in the previous section, we may prove that is a convex set.
Furthermore, for we have that is convex on .
Summarizing, we may define the following convex optimization problem to obtain a critical point of the primal functional J,
We call the Legendre-Galerkin functional associated to J.
12.1. Numerical examples
We have obtained numerical solutions for two one-dimensional examples.
References
- R.A. Adams and J.F. Fournier, Sobolev Spaces, 2nd edn. (Elsevier, New York, 2003).
- 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.
- 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.
- J.F. Annet, Superconductivity, Superfluids and Condensates, 2nd edn. ( Oxford Master Series in Condensed Matter Physics, Oxford University Press, Reprint, 2010).
- F.S. Botelho, Functional Analysis, Calculus of Variations and Numerical Methods in Physics and Engineering, CRC Taylor and Francis, Florida, 2020.
- F.S. Botelho, Advanced Calculus and its Applications in Variational Quantum Mechanics and Relativity Theory, CRC Taylor and Francis, Florida, 2021.
- F.S. Botelho, Variational Convex Analysis, Ph.D. thesis, Virginia Tech, Blacksburg, VA -USA, (2009).
- F. Botelho, Topics on Functional Analysis, Calculus of Variations and Duality, Academic Publications, Sofia, (2011).
- 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]
- F. Botelho, Functional Analysis and Applied Optimization in Banach Spaces, Springer Switzerland, 2014.
- P.Ciarlet, Mathematical Elasticity, Vol. II – Theory of Plates, North Holland Elsevier (1997).
- J.C. Strikwerda, Finite Difference Schemes and Partial Differential Equations, SIAM, second edition (Philadelphia, 2004).
- L.D. Landau and E.M. Lifschits, Course of Theoretical Physics, Vol. 5- Statistical Physics, part 1. (Butterworth-Heinemann, Elsevier, reprint 2008).
- R.T. Rockafellar, Convex Analysis, Princeton Univ. Press, (1970).
- JJ.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-1317 (1989).
- 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. 47 (1995) 677-698, 699-724.
- 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 for the case .

Figure 2.
solution for the case .

Figure 3.
solution for the case .

Figure 4.
solution for the case .

Figure 5.
Density for the Case A.

Figure 6.
Density for the Case B.

Figure 7.
solution for the example 1.

Figure 8.
solution for the example 2.

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. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
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.