Next Article in Journal
Thermophysical Investigation of Oldroyd-B Fluid with Functional Effects of Permeability: Memory Effect Study Using Non-Singular Kernel Derivative Approach
Next Article in Special Issue
Existence of Solutions to a Class of Nonlinear Arbitrary Order Differential Equations Subject to Integral Boundary Conditions
Previous Article in Journal
CMOS OTA-Based Filters for Designing Fractional-Order Chaotic Oscillators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Well Posedness of New Optimization Problems with Variational Inequality Constraints

Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania
Fractal Fract. 2021, 5(3), 123; https://doi.org/10.3390/fractalfract5030123
Submission received: 18 August 2021 / Revised: 10 September 2021 / Accepted: 14 September 2021 / Published: 15 September 2021
(This article belongs to the Special Issue Advances in Optimization and Nonlinear Analysis)

Abstract

:
In this paper, we studied the well posedness for a new class of optimization problems with variational inequality constraints involving second-order partial derivatives. More precisely, by using the notions of lower semicontinuity, pseudomonotonicity, hemicontinuity and monotonicity for a multiple integral functional, and by introducing the set of approximating solutions for the considered class of constrained optimization problems, we established some characterization results on well posedness. Furthermore, to illustrate the theoretical developments included in this paper, we present some examples.

1. Introduction

The notion of well posedness represents a useful mathematical tool by ensuring the convergence of a sequence of approximate solutions to the exact solution of some optimization problems. Starting with the work of Tykhonov [1] for unconstrained optimization problems, various types of well posedness for variational problems have been considered (see, for instance, Levitin-Polyak well posedness [2,3,4,5], extended well posedness [6,7,8,9,10,11,12,13,14]), L-well posedness [15], α -well posedness [16,17]). Moreover, the concept of well posedness can be useful to study some related problems, such as variational inequality and fixed point problems [18,19,20,21,22], hemivariational inequality problems [23], complementary problems [24], equilibrium problems [25,26], Nash equilibrium problems [27] and variational inclusion problems [28]. Recently, the study of well posedness for vector variational inequalities and the associated optimization problems was formulated by Jayswal and Shalini [29]. On the other hand, an important and interesting extension of variational inequality problems is that of multidimensional variational inequality problems and the corresponding multi-time optimization problems (see [30,31,32,33,34,35,36,37,38,39,40]).
Motivated by the aforementioned research works, in this paper we analyze the well posedness of a new class of constrained optimization problems governed by multiple integral functionals involving second-order partial derivatives. To this aim, first we introduce new forms for the concepts of monotonicity, lower semicontinuity, pseudomonotonicity and hemicontinuity associated with a multiple integral functional. Furthermore, we define the set of approximating solutions for the considered optimization problem and establish some characterization theorems on well posedness. The main novelty elements of this paper are represented by the following: the mathematical framework is based on infinite-dimensional function spaces, multiple integral functionals, the presence of second-order partial derivatives, and innovative proofs of the main results. The aforementioned elements are completely new in the area of well-posed variational control problems. Most of the previous works in this field have been studied in classical finite-dimensional spaces, without taking into account the new notions mentioned above.
This paper is organized as follows. Section 2 provides the concepts of monotonicity, pseudomonotonicity, hemicontinuity and the lower semicontinuity of a multiple integral functional, and an auxiliary lemma. Section 3 investigates the well posedness for the considered constrained optimization problem. Concretely, we establish that well posedness and the existence and uniqueness of a solution are equivalent in the aforementioned problem. Furthermore, some examples are formulated throughout the paper to highlight the theoretical elements. Finally, in Section 4, we present the conclusions and provide further developments.

2. Preliminaries

Throughout this work, we consider the following mathematical tools and notations: let Ω be a compact set in R m and Ω ζ = ( ζ α ) , α = 1 , m ¯ ; consider A as the space of C 4 -class state functions a : Ω R n and a α : = a ζ α , a β γ : = 2 a ζ β ζ γ denote the partial speed and partial acceleration, respectively; also, consider U ass the space of C 1 -class control functions u : Ω R k , and consider A × U as a closed, convex and non-empty subset of A × U , ( a , u ) | Ω = given , endowed with the scalar product:
( a , u ) , ( b , w ) = Ω [ a ( ζ ) · b ( ζ ) + u ( ζ ) · w ( ζ ) ] d ζ
= Ω i = 1 n a i ( ζ ) b i ( ζ ) + j = 1 k u j ( ζ ) w j ( ζ ) d ζ , ( a , u ) , ( b , w ) A × U
and the induced norm, where d ζ = d ζ 1 d ζ m denotes the volume element on R m .
Consider J 2 ( R m , R n ) as the second-order jet bundle associated with R m and R n . Taking the scalar continuously differentiable function f : J 2 ( R m , R n ) × R k R , we introduce the following multiple integral-type functional:
F : A × U R , F ( a , u ) = Ω f ζ , a ( ζ ) , a α ( ζ ) , a β γ ( ζ ) , u ( ζ ) d ζ .
At this moment, we are able to introduce the following constrained variational control problem (in short, CVCP), given as follows (we use the notation ( π a , u ( ζ ) ) : = ( ζ , a ( ζ ) , a α ( ζ ) , a β γ ( ζ ) , u ( ζ ) ) ):
( CVCP ) Minimize ( a , u ) Ω f ( π a , u ( ζ ) ) d ζ subject to ( a , u ) Θ ,
where Θ is the solution set of the controlled variational inequality problem (in short, CVIP): to find a pair ( a , u ) A × U  such that:
( CVIP ) Ω [ f a ( π a , u ( ζ ) ) ( b ( ζ ) a ( ζ ) ) + f a α ( π a , u ( ζ ) ) D α ( b ( ζ ) a ( ζ ) )
+ 1 n ( β , γ ) f a β γ ( π a , u ( ζ ) ) D β γ 2 ( b ( ζ ) a ( ζ ) )
+ f u ( π a , u ( ζ ) ) ( w ( ζ ) u ( ζ ) ) ] d ζ 0 , ( b , w ) A × U ,
where D β γ 2 : = D β ( D γ ) , and n ( β , γ ) is the Saunders’s multi-index notation (see Saunders [41], Treanţă [40]).
More precisely, the feasible solution set for (CVIP) is given by
Θ = { ( a , u ) A × U : Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π a , u ( ζ ) ) + D α ( b ( ζ ) a ( ζ ) ) f a α ( π a , u ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π a , u ( ζ ) ) + 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ 0 , ( b , w ) A × U } .
Next, we define the notions of monotonicity and pseudomonotonicity for the aforementioned multiple integral functional.
Definition 1.
The multiple integral functional F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is called monotone on A × U if the following inequality holds:
Ω [ ( a ( ζ ) b ( ζ ) ) f a ( π a , u ( ζ ) ) f a ( π b , w ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) f u ( π a , u ( ζ ) ) f u ( π b , w ( ζ ) ) + D α ( a ( ζ ) b ( ζ ) ) f a α ( π a , u ( ζ ) ) f a α ( π b , w ( ζ ) ) + 1 n ( β , γ ) D β γ 2 ( a ( ζ ) b ( ζ ) ) f a β γ ( π a , u ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 , ( a , u ) , ( b , w ) A × U .
Definition 2.
The multiple integral functional F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is called pseudomonotone on A × U if the following implication holds:
Ω [ ( a ( ζ ) b ( ζ ) ) f a ( π b , w ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( a ( ζ ) b ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ( ζ ) b ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0
Ω [ ( a ( ζ ) b ( ζ ) ) f a ( π a , u ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) f u ( π a , u ( ζ ) )
+ D α ( a ( ζ ) b ( ζ ) ) f a α ( π a , u ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ( ζ ) b ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ 0 , ( a , u ) , ( b , w ) A × U .
Let us give an example of a multiple integral-type functional which is not monotone but is pseudomonotone.
Example 1.
Consider n = k = 1 , m = 2 , and Ω = [ 0 , 3 ] 2 . We define:
f ( π a , u ( ζ ) ) = 2 sin a ( ζ ) + u ( ζ ) e u ( ζ )
and show, in accordance with Definition 2, that the multiple integral functional F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is pseudomonotone on A × U = C 4 ( Ω , [ 1 , 1 ] ) × C 1 ( Ω , [ 1 , 1 ] ) . Indeed, we have:
Ω [ ( a ( ζ ) b ( ζ ) ) f a ( π b , w ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( a ( ζ ) b ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ( ζ ) b ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ
= Ω 2 ( a ( ζ ) b ( ζ ) ) cos b ( ζ ) + ( u ( ζ ) w ( ζ ) ) ( e w ( ζ ) + w ( ζ ) e w ( ζ ) ) d ζ 0 , ( a , u ) , ( b , w ) A × U
Ω [ ( a ( ζ ) b ( ζ ) ) f a ( π a , u ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) f u ( π a , u ( ζ ) )
+ D α ( a ( ζ ) b ( ζ ) ) f a α ( π a , u ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ( ζ ) b ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ
= Ω 2 ( a ( ζ ) b ( ζ ) ) cos a ( ζ ) + ( u ( ζ ) w ( ζ ) ) ( e u ( ζ ) + u ( ζ ) e u ( ζ ) ) d ζ 0 , ( a , u ) , ( b , w ) A × U .
However, it is not monotone on A × U in the sense of Definition 1, because:
Ω [ ( a ( ζ ) b ( ζ ) ) f a ( π a , u ( ζ ) ) f a ( π b , w ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) f u ( π a , u ( ζ ) ) f u ( π b , w ( ζ ) ) + D α ( a ( ζ ) b ( ζ ) ) f a α ( π a , u ( ζ ) ) f a α ( π b , w ( ζ ) ) + 1 n ( β , γ ) D β γ 2 ( a ( ζ ) b ( ζ ) ) f a β γ ( π a , u ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ = Ω [ 2 ( a ( ζ ) b ( ζ ) ) ( cos a ( ζ ) cos b ( ζ ) ) + ( u ( ζ ) w ( ζ ) ) ( u ( ζ ) e u ( ζ ) + e u ( ζ ) w ( ζ ) e w ( ζ ) e w ( ζ ) ) ] d ζ 0 , ( a , u ) , ( b , w ) A × U .
Then, in accordance with Usman and Khan [42], we define the concept of hemicontinuity for the considered multiple integral-type functional.
Definition 3.
The functional F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is hemicontinuous on A × U if the application:
λ ( a ( ζ ) , u ( ζ ) ) ( b ( ζ ) , w ( ζ ) , δ F δ a λ ( ζ ) , δ F δ u λ ( ζ ) , 0 λ 1
is continuous at 0 + , for ( a , u ) , ( b , w ) A × U , where:
δ F δ a λ ( ζ ) : = f a ( π a λ , u λ ( ζ ) ) D α f a α ( π a λ , u λ ( ζ ) ) + 1 n ( β , γ ) D β γ 2 f a β γ ( π a λ , u λ ( ζ ) ) A ,
δ F δ u λ ( ζ ) : = f u ( π a λ , u λ ( ζ ) ) U ,
a λ : = λ a + ( 1 λ ) b , u λ : = λ u + ( 1 λ ) w .
The following lemma is an auxiliary result for proving the main results derived in the present paper.
Lemma 1.
Consider F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is pseudomonotone and hemicontinuous on A × U . The pair ( a , u ) A × U is a solution for (CVIP) if and only if ( a , u ) is a solution for the following variational inequality problem:
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
Proof. 
Consider that the pair ( a , u ) A × U is the solution for (CVIP). As a consequence, it results that:
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π a , u ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π a , u ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π a , u ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
By using the pseudomonotonicity property of the considered multiple integral functional (see Definition 2), the previous inequality involves:
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
Conversely, assume that:
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
For λ ( 0 , 1 ] and ( b , w ) A × U , we define:
( b λ , w λ ) = ( ( 1 λ ) a + λ b , ( 1 λ ) u + λ w ) A × U .
Thus, the above inequality implies:
Ω [ ( b λ ( ζ ) a ( ζ ) ) f a ( π b λ , w λ ( ζ ) ) + ( w λ ( ζ ) u ( ζ ) ) f u ( π b λ , w λ ( ζ ) )
+ D α ( b λ ( ζ ) a ( ζ ) ) f a α ( π b λ , w λ ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b λ ( ζ ) a ( ζ ) ) f a β γ ( π b λ , w λ ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
By considering λ 0 , we obtain:
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π a , u ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π a , u ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π a , u ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ 0 , ( b , w ) A × U ,
which proves that ( a , u ) solves (CVIP). This completes the proof of this lemma. □
Now, we give the definition of lower semicontinuity for the multiple integral functional F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ .
Definition 4.
The multiple integral functional F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is called lower semicontinuous at a point ( a 0 , u 0 ) A × U if:
Ω f ( π a 0 , u 0 ( ζ ) ) d ζ lim ( a , u ) ( a 0 , u 0 ) inf Ω f ( π a , u ( ζ ) ) d ζ .

3. Well Posedness Associated with (CVCP)

In this section, by considering the notions introduced in Section 2, we study the well posedness for the considered class of constrained optimization problems (CVCPs). To this aim, we introduce the following definitions and notations.
Denote by S  solution set of (CVCP), namely:
S = { ( a , u ) A × U | Ω f ( π a , u ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ and Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π a , u ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π a , u ( ζ ) ) + D α ( b ( ζ ) a ( ζ ) ) f a α ( π a , u ( ζ ) ) + 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ 0 , ( b , w ) A × U } .
Consider the set of approximating solutions of (CVCP), for σ , ι 0 , as follows:
S ( σ , ι ) = { ( a , u ) A × U | Ω f ( π a , u ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ + σ and Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π a , u ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π a , u ( ζ ) ) + D α ( b ( ζ ) a ( ζ ) ) f a α ( π a , u ( ζ ) ) + 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ + ι 0 , ( b , w ) A × U } .
Remark 1.
For ( σ , ι ) = ( 0 , 0 ) , we obtain S = S ( σ , ι ) , and for ( σ , ι ) > ( 0 , 0 ) , we obtain S S ( σ , ι ) .
Definition 5.
The sequence { ( a n , u n ) } is an approximating sequence for (CVCP) if there exists ι n 0 (a sequence of positive real numbers) as n , such that:
lim n sup Ω f ( π a n , u n ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ
and:
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π a n , u n ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π a n , u n ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π a n , u n ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) ] d ζ + ι n 0 , ( b , w ) A × U
are fulfilled.
Definition 6.
The constrained optimization (CVCP) is well posed if:
(i) it admits a single solution ( a 0 , u 0 ) ;
and (ii) each approximating sequence of (CVCP) converges to ( a 0 , u 0 ) .
Furthermore, denote by “diam B” the diameter of the set B and it is defined as follows
diam B = sup x , y B x y .
The next theorem represents a first characterization result on the well posedness for (CVCP).
Theorem 1.
Consider that F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is lower semicontinuous, monotone and hemicontinuous on A × U . The constrained optimization problem (CVCP) is well posed if and only if:
S ( σ , ι ) , σ , ι > 0 and d i a m S ( σ , ι ) 0 as ( σ , ι ) ( 0 , 0 ) .
Proof. 
Consider (CVCP) is well posed. In consequence, it admits a single solution ( a ¯ , u ¯ ) S . By using the inclusion S S ( σ , ι ) , σ , ι > 0 , we obtain S ( σ , ι ) , σ , ι > 0 . Now, contrary to the result, suppose that diam S ( σ , ι ) 0 as ( σ , ι ) ( 0 , 0 ) . Consequently, there exists r > 0 , a positive integer m , σ n , ι n > 0 with σ n , ι n 0 , and ( a n , u n ) , ( a n , u n ) S ( σ n , ι n ) such that:
( a n , u n ) ( a n , u n ) > r , n m .
Since ( a n , u n ) , ( a n , u n ) S ( σ n , ι n ) , we obtain:
Ω f ( π a n , u n ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ + σ n ,
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π a n , u n ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π a n , u n ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π a n , u n ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) ] d ζ + ι n 0 , ( b , w ) A × U
and:
Ω f ( π a n , u n ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ + σ n ,
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π a n , u n ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π a n , u n ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π a n , u n ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) ] d ζ + ι n 0 , ( b , w ) A × U .
Clearly, it follows that { ( a n , u n ) } and { ( a n , u n ) ) } are two approximating sequences for (CVCP) which converge to ( a ¯ , u ¯ ) (by hypothesis, the problem (CVCP) is well posed). By computation, we obtain:
( a n , u n ) ( a n , u n )
= ( a n , u n ) ( a ¯ , u ¯ ) + ( a ¯ , u ¯ ) ( a n , u n )
( a n , u n ) ( a ¯ , u ¯ ) + ( a ¯ , u ¯ ) ( a n , u n ) ι ,
which contradicts (1), for some ι = r . It follows that diam S ( σ , ι ) 0 as ( σ , ι ) ( 0 , 0 ) .
Conversely, let { ( a n , u n ) } be an approximating sequence for (CVCP). Therefore, there exists a sequence of positive real numbers ι n 0 as n such that the inequalities:
lim n sup Ω f ( π a n , u n ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ ,
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π a n , u n ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π a n , u n ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π a n , u n ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) ] d ζ + ι n 0 , ( b , w ) A × U
hold, involving that ( a n , u n ) S ( σ n , ι n ) (see σ n 0 as n , a sequence of positive real numbers). By considering diam S ( σ n , ι n ) 0 as ( σ n , ι n ) ( 0 , 0 ) , we obtain that { ( a n , u n ) } is a Cauchy sequence which converges to some ( a ¯ , u ¯ ) A × U as A × U is a closed set.
By using the monotonicity property of Ω f ( π a , u ( ζ ) ) d ζ on A × U , for ( a ¯ , u ¯ ) , ( b , w ) A × U , we have:
Ω [ ( a ¯ ( ζ ) b ( ζ ) ) f a ( π a ¯ , u ¯ ( ζ ) ) f a ( π b , w ( ζ ) )
+ ( u ¯ ( ζ ) w ( ζ ) ) f u ( π a ¯ , u ¯ ( ζ ) ) f a ( π b , w ( ζ ) )
+ D α ( a ¯ ( ζ ) b ( ζ ) ) f a α ( π a ¯ , u ¯ ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ¯ ( ζ ) b ( ζ ) ) f a β γ ( π a ¯ , u ¯ ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 ,
or, equivalently:
Ω [ ( a ¯ ( ζ ) b ( ζ ) ) f a ( π a ¯ , u ¯ ( ζ ) ) + ( u ¯ ( ζ ) w ( ζ ) ) f u ( π a ¯ , u ¯ ( ζ ) )
+ D α ( a ¯ ( ζ ) b ( ζ ) ) f a α ( π a ¯ , u ¯ ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ¯ ( ζ ) b ( ζ ) ) f a β γ ( π a ¯ , u ¯ ( ζ ) ) ] d ζ
Ω [ ( a ¯ ( ζ ) b ( ζ ) ) f a ( π b , w ( ζ ) ) + ( u ¯ ( ζ ) w ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( a ¯ ( ζ ) b ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ¯ ( ζ ) b ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ .
By considering the limit in inequality (3), we obtain:
Ω [ ( a ¯ ( ζ ) b ( ζ ) ) f a ( π a ¯ , u ¯ ( ζ ) ) + ( u ¯ ( ζ ) w ( ζ ) ) f u ( π a ¯ , u ¯ ( ζ ) )
+ D α ( a ¯ ( ζ ) b ( ζ ) ) f a α ( π a ¯ , u ¯ ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a ¯ ( ζ ) b ( ζ ) ) f a β γ ( π a ¯ , u ¯ ( ζ ) ) ] d ζ 0 .
By using (4) and (5), it results that:
Ω [ ( b ( ζ ) a ¯ ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u ¯ ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a ¯ ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ¯ ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 .
Now, we use Lemma 1 to obtain:
Ω [ ( b ( ζ ) a ¯ ( ζ ) ) f a ( π a ¯ , u ¯ ( ζ ) ) + ( w ( ζ ) u ¯ ( ζ ) ) f u ( π a ¯ , u ¯ ( ζ ) )
+ D α ( b ( ζ ) a ¯ ( ζ ) ) f a α ( π a ¯ , u ¯ ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ¯ ( ζ ) ) f a β γ ( π a ¯ , u ¯ ( ζ ) ) ] d ζ 0 ,
which implies that ( a ¯ , u ¯ ) Θ .
Since the functional Ω f ( π a , u ( ζ ) ) d ζ is lower semi-continuous, we conclude:
Ω f ( π a ¯ , u ¯ ( ζ ) ) d ζ lim n inf Ω f ( π a n , u n ( ζ ) ) d ζ lim n sup Ω f ( π a n , u n ( ζ ) ) d ζ .
By (2), the previous inequality can be written as
Ω f ( π a ¯ , u ¯ ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ .
As a consequence, by (6) and (7), we obtain that ( a ¯ , u ¯ ) is the solution for (CVCP).
Let us prove that ( a ¯ , u ¯ ) is the single solution for (CVCP). Suppose that ( a 1 , u 1 ) ( a 2 , u 2 ) are two solutions for (CVCP). Then:
0 < ( a 1 , u 1 ) ( a 2 , u 2 ) diam S ( σ , ι ) 0 as ( σ , ι ) ( 0 , 0 ) ,
which is not possible. The proof is now complete. □
The second main result of this paper is contained in the next theorem.
Theorem 2.
Consider F ( a , u ) = Ω f ( π a , u ( ζ ) ) d ζ is lower semicontinuous, monotone and hemicontinuous on A × U . The constrained optimization problem (CVCP) is well posed if and only if it admits a solution.
Proof. 
Consider that (CVCP) is well posed. In consequence, it has a solution ( a 0 , u 0 ) . Conversely, consider that (CVCP) has a solution ( a 0 , u 0 ) , that is:
Ω f ( π a 0 , u 0 ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ ,
Ω [ ( b ( ζ ) a 0 ( ζ ) ) f a ( π a 0 , u 0 ( ζ ) ) + ( w ( ζ ) u 0 ( ζ ) ) f u ( π a 0 , u 0 ( ζ ) )
+ D α ( b ( ζ ) a 0 ( ζ ) ) f a α ( π a 0 , u 0 ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a 0 ( ζ ) ) f a β γ ( π a 0 , u 0 ( ζ ) ) ] d ζ 0 , ( b , w ) A × U ,
but (CVCP) is not well posed. Therefore, by Definition 6, there exists an approximating sequence { ( a n , u n ) } of (CVCP) (which does not converge to ( a 0 , u 0 ) ), that is the following inequalities hold:
lim n sup Ω f ( π a n , u n ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ
and:
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π a n , u n ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π a n , u n ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π a n , u n ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) ] d ζ + ι n 0 , ( b , w ) A × U .
Furthermore, to prove the boundedness of { ( a n , u n ) } , we proceed by contradiction. Suppose, in contrast to the result, { ( a n , u n ) } is not bounded, that is, ( a n , u n ) + as n + . Let us consider δ n = 1 ( a n , u n ) ( a 0 , u 0 ) and ( a n , u n ) = ( a 0 , u 0 ) + δ n [ ( a n , u n ) ( a 0 , u 0 ) ] . We can see that { ( a n , u n ) } is bounded in A × U . If necessary, passing to a subsequence, we may consider that:
( a n , u n ) ( a , u ) weakly   in A × U ( a 0 , u 0 ) .
It is easy to check that ( a , u ) ( a 0 , u 0 ) thanks to δ n [ ( a n , u n ) ( a 0 , u 0 ) ] = 1 , for all n N . Since ( a 0 , u 0 ) is a solution of (CVCP), the inequalities in (8) are satisfied. By Lemma 1, we obtain:
Ω f ( π a 0 , u 0 ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ ,
Ω [ ( b ( ζ ) a 0 ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u 0 ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a 0 ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a 0 ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
By using the monotonicity property of the multiple integral functional Ω f ( π a , u ( ζ ) ) d ζ on A × U , for ( a n , u n ) , ( b , w ) A × U , we have:
Ω [ ( a n ( ζ ) b ( ζ ) ) f a ( π a n , u n ( ζ ) ) f a ( π b , w ( ζ ) )
+ ( u n ( ζ ) w ( ζ ) ) f u ( π a n , u n ( ζ ) ) f a ( π b , w ( ζ ) )
+ D α ( a n ( ζ ) b ( ζ ) ) f a α ( π a n , u n ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( a n ( ζ ) b ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 ,
or, equivalently:
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π a n , u n ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π a n , u n ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π a n , u n ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π a n , u n ( ζ ) ) ] d ζ
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ .
Combining with (9) and (11), we have:
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ ι n , ( b , w ) A × U .
Because of δ n 0 as n (by the assumption that { ( a n , u n ) } is not bounded), so, we can take n 0 N be large enough such that δ n < 1 , for all n n 0 . Then, by multiplying the previous inequality and (10) by δ n > 0 and 1 δ n > 0 , respectively, we obtain:
Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ ι n , ( b , w ) A × U , n n 0 .
Since ( a n , u n ) ( a , u ) ( a 0 , u 0 ) and ( a n , u n ) = ( a 0 , u 0 ) + ( a n , u n ) [ ( a n , u n ) ( a 0 , u 0 ) ] , we have:
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ
= lim n Ω [ ( b ( ζ ) a n ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u n ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a n ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ
lim n ι n = 0 , ( b , w ) A × U .
By considering the lower semicontinuity of the considered functional, and taking into account Lemma 1, we have:
Ω f ( π a , u ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ ,
Ω [ ( b ( ζ ) a ( ζ ) ) f a ( π a , u ( ζ ) ) + ( w ( ζ ) u ( ζ ) ) f u ( π a , u ( ζ ) )
+ D α ( b ( ζ ) a ( ζ ) ) f a α ( π a , u ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ( ζ ) ) f a β γ ( π a , u ( ζ ) ) ] d ζ 0 , ( b , w ) A × U .
We obtain that ( a , u ) is a solution of (CVCP), which contradicts the uniqueness of ( a 0 , u 0 ) . In consequence, { ( a n , u n ) } is a bounded sequence with a convergent subsequence { ( a n k , u n k ) } which converges to ( a ¯ , u ¯ ) A × U as k . Now, by Definition 1, for ( a n k , u n k ) , ( b , w ) A × U , we have (see (11)):
Ω [ ( b ( ζ ) a n k ( ζ ) ) f a ( π a n k , u n k ( ζ ) ) + ( w ( ζ ) u n k ( ζ ) ) f u ( π a n k , u n k ( ζ ) )
+ D α ( b ( ζ ) a n k ( ζ ) ) f a α ( π a n k , u n k ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n k ( ζ ) ) f a β γ ( π a n k , u n k ( ζ ) ) ] d ζ
Ω [ ( b ( ζ ) a n k ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u n k ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a n k ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n k ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ .
Furthermore, on behalf of (9), we can write that:
lim k Ω [ ( b ( ζ ) a n k ( ζ ) ) f a ( π a n k , u n k ( ζ ) ) + ( w ( ζ ) u n k ( ζ ) ) f u ( π a n k , u n k ( ζ ) )
+ D α ( b ( ζ ) a n k ( ζ ) ) f a α ( π a n k , u n k ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n k ( ζ ) ) f a β γ ( π a n k , u n k ( ζ ) ) ] d ζ 0 .
Combining (13) and (14), we have:
lim k Ω [ ( b ( ζ ) a n k ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u n k ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a n k ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a n k ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0
Ω [ ( b ( ζ ) a ¯ ( ζ ) ) f a ( π b , w ( ζ ) ) + ( w ( ζ ) u ¯ ( ζ ) ) f u ( π b , w ( ζ ) )
+ D α ( b ( ζ ) a ¯ ( ζ ) ) f a α ( π b , w ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ¯ ( ζ ) ) f a β γ ( π b , w ( ζ ) ) ] d ζ 0 .
By considering the lower semicontinuity of the considered functional, in accordance with Lemma 1, we have:
Ω f ( π a ¯ , u ¯ ( ζ ) ) d ζ inf ( b , w ) Θ Ω f ( π b , w ( ζ ) ) d ζ ,
Ω [ ( b ( ζ ) a ¯ ( ζ ) ) f a ( π a ¯ , u ¯ ( ζ ) ) + ( w ( ζ ) u ¯ ( ζ ) ) f u ( π a ¯ , u ¯ ( ζ ) )
+ D α ( b ( ζ ) a ¯ ( ζ ) ) f a α ( π a ¯ , u ¯ ( ζ ) )
+ 1 n ( β , γ ) D β γ 2 ( b ( ζ ) a ¯ ( ζ ) ) f a β γ ( π a ¯ , u ¯ ( ζ ) ) ] d ζ 0 ,
implying that ( a ¯ , u ¯ ) is a solution for (CVCP). Therefore, ( a n k , u n k ) ( a ¯ , u ¯ ) , that is, ( a n k , u n k ) ( a 0 , u 0 ) , involving ( a n , u n ) ( a 0 , u 0 ) and the proof is complete. □
In the following illustrative example, we present an application of Theorems 1 and 2, as well.
Example 2.
Let us consider n = k = 1 , m = 2 , and Ω = [ 0 , 3 ] 2 . We define:
f ( π a , u ( ζ ) ) = 3 u 2 ( ζ ) + e a ( ζ ) a ( ζ )
and consider the following constrained variational control problem:
( CVCP - 1 ) M i n i m i z e ( a , u ) Ω f ( π a , u ( ζ ) ) d ζ
                         subject to
Ω 6 ( w ( ζ ) u ( ζ ) ) u ( ζ ) + ( b ( ζ ) a ( ζ ) ) ( e a ( ζ ) 1 ) d ζ 0 , ( b , w ) A × U ,
( a , u ) | Ω = 0 .
We have S = { ( 0 , 0 ) } . Moreover, we have that the functional Ω f ( π a , u ( ζ ) ) d ζ is monotone, hemicontinuous and lower semicontinuous on A × U = C 4 ( Ω , [ 10 , 10 ] ) × C 1 ( Ω , [ 10 , 10 ] ) . In consequence, all hypotheses in Theorem 2 hold, therefore the optimization problem (CVCP-1) is well posed. Furthermore, since S ( σ , ι ) = { ( 0 , 0 ) } , we obtain S ( σ , ι ) and diam S ( σ , ι ) 0 as ( σ , ι ) ( 0 , 0 ) . Consequently, by using Theorem 1, we obtain that the constrained optimization problem (CVCP-1) is well posed.

4. Conclusions and Further Developments

In this paper, we investigated the well posedness for a new class of constrained optimization problems governed by second-order partial derivatives. Concretely, by using the monotonicity, lower semicontinuity, pseudomonotonicity and hemicontinuity of multiple integral functional, we proved that the well posedness of the constrained optimization problem under study is characterized in terms of existence and uniqueness of solution. Furthermore, the theoretical developments have been accompanied by some examples.
Some further developments associated with the present paper are the following: to formulate the necessary and sufficient optimality conditions for the considered optimization problems, to establish some duality results, and to study the well posedness for similar classes of control problems by using fractional derivatives.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Tykhonov, A.N. On the stability of the functional optimization problems. USSR Comput. Math. Math. Phys. 1966, 6, 631–634. [Google Scholar] [CrossRef]
  2. Hu, R.; Fang, Y.P. Levitin-Polyak well-posedness by perturbations of inverse variational inequalities. Optim. Lett. 2013, 7, 343–359. [Google Scholar] [CrossRef]
  3. Jiang, B.; Zhang, J.; Huang, X.X. Levitin-Polyak well-posedness of generalized quasivariational inequalities with functional constraints. Nonlinear Anal. TMA 2009, 70, 1492–1503. [Google Scholar] [CrossRef]
  4. Lalitha, C.S.; Bhatia, G. Levitin-Polyak well-posedness for parametric quasivariational inequality problem of the Minty type. Positivity 2012, 16, 527–541. [Google Scholar] [CrossRef]
  5. Levitin, E.S.; Polyak, B.T. Convergence of minimizing sequences in conditional extremum problems. Sov. Math. Dokl. 1996, 7, 764–767. [Google Scholar]
  6. Čoban, M.M.; Kenderov, P.S.; Revalski, J.P. Generic well-posedness of optimization problems in topological spaces. Mathematika 1989, 36, 301–324. [Google Scholar] [CrossRef]
  7. Dontchev, A.L.; Zolezzi, T. Well-Posed Optimization Problems; Springer: Berlin, Germany, 1993. [Google Scholar]
  8. Furi, M.; Vignoli, A. A characterization of well-posed minimum problems in a complete metric space. J. Optim. Theory Appl. 1970, 5, 452–461. [Google Scholar] [CrossRef]
  9. Huang, X.X. Extended and strongly extended well-posedness of set-valued optimization problems. Math. Methods Oper. Res. 2001, 53, 101–116. [Google Scholar] [CrossRef]
  10. Huang, X.X.; Yang, X.Q. Generalized Levitin-Polyak well-posedness in constrained optimization. SIAM J. Optim. 2006, 17, 243–258. [Google Scholar] [CrossRef] [Green Version]
  11. Lignola, M.B.; Morgan, J. Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution. J. Glob. Optim. 2000, 16, 57–67. [Google Scholar] [CrossRef]
  12. Lin, L.J.; Chuang, C.S. Well-posedness in the generalized sense for variational inclusion and disclusion problems and well-posedness for optimization problems with constraint. Nonlinear Anal. 2009, 70, 3609–3617. [Google Scholar] [CrossRef]
  13. Lucchetti, R. Convexity and Well-Posed Problems; Springer: New York, NY, USA, 2006. [Google Scholar]
  14. Zolezzi, T. Extended well-posedness of optimization problems. J. Optim. Theory Appl. 1996, 91, 257–266. [Google Scholar] [CrossRef]
  15. Lignola, M.B. Well-posedness and L-well-posedness for quasivariational inequalities. J. Optim. Theory Appl. 2006, 128, 119–138. [Google Scholar] [CrossRef] [Green Version]
  16. Lignola, M.B.; Morgan, J. Approximate Solutions and α-Well-Posedness for Variational Inequalities and Nash Equilibria, Decision and Control in Management Science; Zaccour, G., Ed.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2002; pp. 367–378. [Google Scholar]
  17. Virmani, G.; Srivastava, M. On Levitin-Polyak α-well-posedness of perturbed variational-hemivariational inequality. Optimization 2015, 64, 1153–1172. [Google Scholar] [CrossRef]
  18. Ceng, L.C.; Yao, J.C. Well-posedness of generalized mixed variational inequalities, inclusion problems and fixed-point problems. Nonlinear Anal. 2008, 69, 4585–4603. [Google Scholar] [CrossRef]
  19. Ceng, L.C.; Hadjisavvas, N.; Schaible, S.; Yao, J.C. Well-posedness for mixed quasivariational-like inequalities. J. Optim. Theory Appl. 2008, 139, 109–125. [Google Scholar] [CrossRef]
  20. Fang, Y.P.; Hu, R. Estimates of approximate solutions and well-posedness for variational inequalities. Math. Meth. Oper. Res. 2007, 65, 281–291. [Google Scholar] [CrossRef]
  21. Hammad, H.A.; Aydi, H.; la Sen, M.D. New contributions for tripled fixed point methodologies via a generalized variational principle with applications. Alex. Eng. J. 2021, in press. [Google Scholar] [CrossRef]
  22. Lalitha, C.S.; Bhatia, G. Well-posedness for parametric quasivariational inequality problems and for optimization problems with quasivariational inequality constraints. Optimization 2010, 59, 997–1011. [Google Scholar] [CrossRef]
  23. Xiao, Y.B.; Yang, X.M.; Huang, N.J. Some equivalence results for well-posedness of hemivariational inequalities. J. Glob. Optim. 2015, 61, 789–802. [Google Scholar] [CrossRef]
  24. Heemels, P.M.H.; Camlibel, M.K.C.; Schaft, A.J.V.; Schumacher, J.M. Well-posedness of the complementarity class of hybrid systems. In Proceedings of the 15th IFAC Triennial World Congress, Barcelona, Spain, 21–26 July 2002. [Google Scholar]
  25. Chen, J.W.; Wang, Z.; Cho, Y.J. Levitin-Polyak well-posedness by perturbations for systems of set-valued vector quasi-equilibrium problems. Math. Meth. Oper. Res. 2013, 77, 33–64. [Google Scholar] [CrossRef]
  26. Fang, Y.P.; Hu, R.; Huang, N.J. Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints. Comput. Math. Appl. 2008, 55, 89–100. [Google Scholar] [CrossRef] [Green Version]
  27. Lignola, M.B.; Morgan, J. α-Well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints. J. Glob. Optim. 2006, 36, 439–459. [Google Scholar] [CrossRef] [Green Version]
  28. Agarwal, P.; Filali, D.; Akram, M.; Dilshad, M. Convergence Analysis of a Three-Step Iterative Algorithm for Generalized Set-Valued Mixed-Ordered Variational Inclusion Problem. Symmetry 2021, 13, 444. [Google Scholar] [CrossRef]
  29. Jayswal, A.; Jha, S. Well-posedness for generalized mixed vector variational-like inequality problems in Banach space. Math. Commun. 2017, 22, 287–302. [Google Scholar]
  30. Treanţă, S. A necessary and sufficient condition of optimality for a class of multidimensional control problems. Optim. Control Appl. Meth. 2020, 41, 2137–2148. [Google Scholar] [CrossRef]
  31. Treanţă, S.; Arana-Jiménez, M.; Antczak, T. A necessary and sufficient condition on the equivalence between local and global optimal solutions in variational control problems. Nonlinear Anal. 2020, 191, 111640. [Google Scholar] [CrossRef]
  32. Treanţă, S. On a modified optimal control problem with first-order PDE constraints and the associated saddle-point optimality criterion. Eur. J. Control 2020, 51, 1–9. [Google Scholar] [CrossRef]
  33. Treanţă, S. Some results on (ρ,b,d)-variational inequalities. J. Math. Ineq. 2020, 14, 805–818. [Google Scholar] [CrossRef]
  34. Treanţă, S. On weak sharp solutions in (ρ,b,d)-variational inequalities. J. Ineq. Appl. 2020, 2020, 54. [Google Scholar] [CrossRef] [Green Version]
  35. Treanţă, S.; Singh, S. Weak sharp solutions associated with a multidimensional variational-type inequality. Positivity 2021, 25, 329–351. [Google Scholar] [CrossRef]
  36. Treanţă, S.; Das, K. On robust saddle-point criterion in optimization problems with curvilinear integral functionals. Mathematics 2021, 9, 1790. [Google Scholar] [CrossRef]
  37. Treanţă, S. On well-posed isoperimetric-type constrained variational control problems. J. Differ. Eq. 2021, 298, 480–499. [Google Scholar] [CrossRef]
  38. Treanţă, S. Second-order PDE constrained controlled optimization problems with application in mechanics. Mathematics 2021, 9, 1472. [Google Scholar] [CrossRef]
  39. Treanţă, S. On a class of second-order PDE&PDI constrained robust modified optimization problems. Mathematics 2021, 9, 1473. [Google Scholar]
  40. Treanţă, S. On a class of isoperimetric constrained controlled optimization problems. Axioms 2021, 10, 112. [Google Scholar] [CrossRef]
  41. Saunders, D.J. The Geometry of Jet Bundles, London Math. Soc. Lecture; Notes Series, 142; Cambridge University Press: Cambridge, UK, 1989. [Google Scholar]
  42. Usman, F.; Khan, S.A. A generalized mixed vector variational-like inequality problem. Nonlinear Anal. 2009, 71, 5354–5362. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Treanţă, S. Well Posedness of New Optimization Problems with Variational Inequality Constraints. Fractal Fract. 2021, 5, 123. https://doi.org/10.3390/fractalfract5030123

AMA Style

Treanţă S. Well Posedness of New Optimization Problems with Variational Inequality Constraints. Fractal and Fractional. 2021; 5(3):123. https://doi.org/10.3390/fractalfract5030123

Chicago/Turabian Style

Treanţă, Savin. 2021. "Well Posedness of New Optimization Problems with Variational Inequality Constraints" Fractal and Fractional 5, no. 3: 123. https://doi.org/10.3390/fractalfract5030123

Article Metrics

Back to TopTop