Next Article in Journal
Optimizing Fleet Size in Point-to-Point Shared Demand Responsive Transportation Service: A Network Decomposition Approach
Previous Article in Journal
Stability and Control of Car Dynamics with a Quarter Model via a Novel Simple Harmonic Hump under External Force
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds

by
Balendu Bhooshan Upadhyay
1,
Arnav Ghosh
1,
Savin Treanţă
2,3,4 and
Jen-Chih Yao
5,6,*
1
Department of Mathematics, Indian Institute of Technology Patna, Patna 801103, India
2
Department of Applied Mathematics, National University of Science and Technology POLITEHNICA Bucharest, 060042 Bucharest, Romania
3
Academy of Romanian Scientists, 54 Splaiul Independentei, 050094 Bucharest, Romania
4
“Fundamental Sciences Applied in Engineering” Research Center (SFAI), National University of Science and Technology POLITEHNICA Bucharest, 060042 Bucharest, Romania
5
Center for General Education, China Medical University, Taichung 40402, Taiwan
6
Academy of Romanian Scientists, 050044 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(19), 3047; https://doi.org/10.3390/math12193047
Submission received: 22 August 2024 / Revised: 20 September 2024 / Accepted: 27 September 2024 / Published: 28 September 2024
(This article belongs to the Special Issue Variational Problems and Applications, 3rd Edition)

Abstract

:
In this paper, we investigate constraint qualifications and optimality conditions for multiobjective mathematical programming problems with vanishing constraints (MOMPVC) on Hadamard manifolds. The MOMPVC-tailored generalized Guignard constraint qualification (MOMPVC-GGCQ) for MOMPVC is introduced in the setting of Hadamard manifolds. By employing MOMPVC-GGCQ and the intrinsic properties of Hadamard manifolds, we establish Karush–Kuhn–Tucker (KKT)-type necessary Pareto efficiency criteria for MOMPVC. Moreover, we introduce several MOMPVC-tailored constraint qualifications and develop interrelations among them. In particular, we establish that the MOMPVC-tailored constraint qualifications introduced in this paper turn out to be sufficient conditions for MOMPVC-GGCQ. Suitable illustrative examples are furnished in the framework of well-known Hadamard manifolds to validate and demonstrate the importance and significance of the derived results. To the best of our knowledge, this is the first time that constraint qualifications, their interrelations, and optimality criteria for MOMPVC have been explored in the framework of Hadamard manifolds.

1. Introduction

In optimization theory, mathematical programming problems with vanishing constraints (MPVC) have transpired as a very interesting class of problem in the last few years. The nomenclature ‘vanishing constraints’ is derived from the fact that some of the constraints present in the problem may become redundant on some particular feasible elements of MPVC (see, for instance, [1]). One of the primary challenges encountered in the investigation of MPVC is the fact that the feasible set of MPVC may be non-convex and disconnected, despite the presence of convex constraint functions (see, for instance, [2]). Furthermore, in general, standard constraint qualifications, such as the Mangasarian–Fromovitz constraint qualification (MFCQ) and linear independence constraint qualification (LICQ), are violated at an arbitrary feasible point of MPVC (see, for instance, [3,4]). Recently, researchers have observed that various real-world problems emerging in several areas of engineering and technology can be modeled as MPVC. Achtziger and Kanzow [1] demonstrated that important real-world problems in the field of mechanical engineering, such as the truss optimization problem, can be formulated as an MPVC. Dai [5] modeled the problem of finding optimal pressure control in water distribution systems as an MPVC. Kirches et al. [6] investigated the problem of robot motion planning by formulating the corresponding problem as an MPVC. For more comprehensive discussions and updated surveys of MPVC, we refer the readers to [7,8,9,10] and the references provided therein.
Achtziger and Kanzow [1] established that many of the standard constraint qualifications fail to be satisfied for MPVC and developed several MPVC-tailored constraint qualifications. Hoheisel and Kanzow [9] derived necessary optimality conditions for MPVC by employing Abadie-type constraint qualification, as well as Guignard-type constraint qualification. Guu et al. [11] derived strong Karush–Kuhn–Tucker-type sufficient optimality conditions for MPVC, with infinitely many constraints. Mishra et al. [12] studied several constraint qualifications for MPVC with vector-valued objective functions. Wolfe-type, as well as the Mond-Weir type duality models for MPVC, were formulated by Mishra et al. [13], and several duality theorems were derived. Several constraint qualifications and their interrelations for MPVC in the Hadamard manifold framework were developed by Upadhyay and Ghosh [14]. One-parameter regularization methods for MPVC were explored by Hoheisel et al. [3]. Optimality conditions for nonsmooth MPVC were developed by Shirdel et al. [15] via the Dini–Hadamard derivative. Hassan et al. [16] investigated M-stationary conditions and duality for MPVC. Recently, Upadhyay et al. [17] derived necessary and sufficient Pareto efficiency criteria for semi-infinite MPVC with a vector-valued objective function on Hadamard manifolds and further investigated some duality models for MPVC. However, in this context, it is noteworthy that there is no research paper available in the literature that explores constraint qualifications and their interrelations for multiobjective MPVC in the framework of Hadamard manifolds.
In recent years, the exploration of optimization problems on manifolds has turned out to be a very significant research topic. For modeling and analyzing many practical problems of modern research, especially in data analysis, the manifold framework has been found to be more advantageous than the traditional Euclidean space setting (for reference, see [18,19,20]). On the other hand, generalizing various methods of optimization from Euclidean spaces to the framework of manifolds has numerous important advantages. Many challenging constrained non-convex optimization problems formulated in the Euclidean space can be reformulated as simpler, unconstrained, as well as convex problems within the Hadamard manifold framework (see [21,22,23]). As a direct consequence to these advantages, in the last few years, numerous scholars have generalized various key ideas related to optimization theory from the Euclidean space setting to the Hadamard manifold framework (see [24,25,26,27,28] and the references provided therein).
Contrary to Euclidean spaces, Hadamard manifolds, in general, do not possess a linear structure. As a result, in spite of the fact that Hadamard manifolds are globally homeomorphic to Euclidean spaces, the investigation of optimization techniques on Hadamard manifolds is associated with several challenges. Specifically, in sharp contrast to Euclidean space, the notion of a unique line segment joining any two points is not available in the Hadamard manifold setting. Moreover, the exponential function and inverse of the exponential function are nonlinear functions on Hadamard manifolds (see, for instance, [29]). Consequently, researchers have developed new techniques over the past few decades to study optimization problems on Hadamard manifolds. For instance, the concept of geodesic convexity is introduced in the Hadamard manifold setting, employing the notion of unique minimal geodesics to connect any two points in the Hadamard manifold. Moreover, the concepts of parallel transport and exponential maps on the tangent space of a Hadamard manifold (which has a vector space structure) are employed in order to deal with the nonlinearity of manifolds. The central motivation and principal objective to investigate nonsmooth MOMPVC on Hadamard manifolds, rather than Riemannian manifolds, is as follows. Firstly, the exponential function is globally diffeomorphic in the case of Hadamard manifolds (see, for instance, [30]). Nevertheless, the exponential function is locally diffeomorphic on Riemannian manifolds. Thus, the results derived in the present manuscript on Hadamard manifolds are valid within the totally normal neighborhood of each point on Riemannian manifolds.
It is noteworthy to observe that, in the last few decades, researchers have thoroughly explored optimality criteria for single-objective as well as multiobjective optimization problems in the framework of Euclidean space (see, for instance, [31,32,33] and the references provided therein). Furthermore, in recent times, constraint qualifications and optimality conditions for optimization problems involving scalar-valued and vector-valued objective functions in the Riemannian and Hadamard manifold framework have been investigated by several researchers (see, for instance, [25,26,34] and the references provided therein). Nevertheless, constraint qualifications and optimality criteria for a very important class of optimization problems, namely, multiobjective optimization problems with vanishing constraints (MOMPVC) have not yet been studied in the Hadamard manifold framework. The primary motivation as well as the the central objective of this paper is to address the aforementioned research gap, introduce various constraint qualifications and derive their interrelations, and further establish necessary Pareto efficiency criteria for MOMPVC in the Hadamard manifold framework.
Motivated by the results and discussions presented in the papers [9,11,12], we explore a class of MOMPVC in the Hadamard manifold framework. Firstly, the MOMPVC-tailored generalized Guignard constraint qualification (MOMPVC-GGCQ) is introduced in the framework of Hadamard manifolds. We further establish necessary optimality conditions for MOMPVC using MOMPVC-GGCQ. Thereafter, we introduce several MOMPVC-tailored constraint qualifications, for instance, Cottle-type constraint qualification, Slater-type constraint qualification, and Mangasarian–Fromovitz constraint qualification, which in turn become sufficient conditions for MOMPVC-GGCQ. Non-trivial illustrative examples have been incorporated to validate the effectiveness of the deduced results.
The primary contributions and novelty of this paper are as follows. Firsly, we extend several constraint qualifications developed by Mishra et al. [12] from the linear Euclidean space framework to the non-linear, more general space of Hadamard manifolds. Moreover, the optimality conditions deduced in this paper extend the corresponding optimality criteria developed by Hoheisel and Kanzow [9] from Euclidean space to Hadamard manifolds, and further generalize them from single objective MPVC to a more general class of mathematical programming problems, namely, MOMPVC. Secondly, the results established in this paper extend the corresponding results derived by Maeda [33] for a more general class of optimization problems, that is, MOMPVC, and further generalize them from the Euclidean space setting to the framework of a wider space, namely, Hadamard manifolds.
The rest of the article is structured as follows: Basic notations and definitions are provided in Section 2. In Section 3, we consider a class of MOMPVC in the framework of Hadamard manifolds. MOMPVC-GGCQ is introduced in the Hadamard manifold framework and KKT-type necessary criteria of optimality for MOMPVC are established. Subsequently, in Section 4, we present several MOMPVC-tailored constraint qualifications, which in turn become sufficient conditions ensuring the satisfaction of MOMPVC-GGCQ. Finally, we conclude our discussions and throw some light on our further research endeavors in Section 5.

2. Basic Notations, Definitions, and Mathematical Preliminaries

Throughout the paper, the symbols N and R will be employed to represent the set consisting of every natural and real number, respectively. The notation ∅ signifies the empty set. Let n N . The symbol R n denotes the n-dimensional Euclidean space. The standard inner product on R n is signified by · , · . For r , s R n , the notation r s implies that r i s i , for every i = 1 , 2 , , n . Further, r s indicates that r s and r s . Moreover, we use the following conventions:
r s r k < s k , k = 1 , , n . r s r k s k , k = 1 , , n ; r m < s m , for at least one m { 1 , , n } .
We employ the symbol H n to denote an n-dimensional Riemannian manifold. H n is said to be a Hadamard manifold, provided that it is geodesic complete, simply connected, and moreover, the sectional curvature of H n is non-positive everywhere. Henceforth, in this paper, the symbol H n will always indicate an n-dimensional Hadamard manifold, unless otherwise stated.
Let a ^ H n . The tangent space at a ^ is denoted by the symbol T a ^ H n . It is a well-known fact that T a ^ H n is a linear space having a dimension n. Let B T a ^ H n be non-empty. The notations cl ( B ) and co ( B ) are used to signify the closure and the convex hull of set B , respectively.
The exponential mapping exp a ^ : T a ^ H n H n is a globally diffeomorphic map. Further, exp a ^ 1 : H n T a ^ H n satisfies exp a ^ 1 ( a ^ ) = 0 . On the other hand, for every a ^ 1 , a ^ 2 H n , some unique normalized minimal geodesic ν a ^ 1 , a ^ 2 : [ 0 , 1 ] H n always exists, satisfying:
ν a ^ 1 , a ^ 2 ( τ ) = exp a ^ 1 ( τ exp a ^ 1 1 ( a ^ 2 ) ) , τ [ 0 , 1 ] .
 Remark 1. 
In light of Theorem 2.1 established by Kristaly et al. [29], exponential map exp : T a ^ H n H n on Hadamard manifolds with zero sectional curvature is a global isometry. Despite the well-known fact that Hadamard manifolds with zero sectional curvature are isometric to Euclidean spaces, there are significant problems that one encounters while investigating optimization problems in the framework of Hadamard manifolds with negative sectional curvature. For instance, due to the linear structure of Euclidean space, it is apparent that x y = ( y x ) , for any x , y R n . However, in the framework of Hadamard manifold H n , exp y 1 x exp x 1 y , x , y H n , due to its nonlinear structure. As a result, the development of optimization techniques on Hadamard manifolds with non-zero sectional curvatures is significantly difficult, as compared to Euclidean spaces.
Let R n denote a complete and connected Riemannian manifold. A subset U R n is termed as a strongly convex set, provided that for any a , b U some unique minimal geodesic exists in R n that connects the points a and b. We employ the symbol B a ^ * ( w , α ) to represent the ball centered at w T a ^ R n , having a radius α > 0 . Moreover, we employ the notation B α ( a ^ ) to signify the ball centered at a ^ R n with radius α > 0 . Let 0 ¯ denote the zero vector in T a ^ R n .
We now present the following definitions from [30].
 Definition 1. 
The injectivity and convexity radius corresponding to p ^ R n , denoted by s ( p ^ ) and r ( p ^ ) , respectively, are defined as follows:
s ( p ^ ) : = sup { α > 0 | exp p ^ : B p ^ * ( 0 ¯ , α ) T p ^ R n exp p ^ ( B p ^ * ( 0 ¯ , α ) ) is a diffeomorphism } ,
r ( p ^ ) : = sup { α > 0 | each ball in B α ( p ^ ) is strongly convex and each geodesic in B α ( p ^ ) is a minimal geodesic } .
 Remark 2. 
(i) 
It is well-known that (see, for instance, [30]):
s ( p ^ ) r ( p ^ ) > 0 , p ^ R n .
(ii) 
The set U p ^ = exp p ^ ( B p ^ * ( 0 ¯ , t ) ) is known as the totally normal neighborhood of p ^ . If R n = H n , U p ^ = H n , p ^ H n . Indeed, in view of the Cartan–Hadamard theorem (see, for instance, [23]), we know that the exponential map is globally diffeomorphic in the case of Hadamard manifolds. Consequently, if R n = H n , then we have:
r ( p ^ ) = s ( p ^ ) = + , p ^ H n .
Hence, from Definition 1, it follows that, if R n = H n , then
U p ^ = H n , p ^ H n .
(iii) 
Therefore, H n is globally diffeomorphic to Euclidean space, while a Riemannian manifold is locally diffeomorphic to Euclidean space. Thus, the results derived in this paper in the setting of Hadamard manifolds need not be true globally for a general Riemannian manifold. In particular, the established results within the framework of Hadamard manifolds hold within the totally normal neighborhood of each point in a Riemannian manifold.
Let F : H n R be differentiable. The gradient of F, denoted by grad F, is defined as d F ( Z ) = grad F , Z = Z ( F ) , where Z is also a vector field on H n .
The following definition is from Udrişte [23].
 Definition 2. 
A set V ( ) H n is called a geodesic convex set, if for any a ^ 1 , a ^ 2 V ( a ^ 1 a ^ 2 ), and for any geodesic γ a ^ 1 , a ^ 2 : [ 0 , 1 ] H n that connects a ^ 1 and a ^ 2 , the following holds:
γ a ^ 1 , a ^ 2 ( τ ) V , τ [ 0 , 1 ] ,
where, γ a ^ 1 , a ^ 2 ( τ ) = exp a ^ 1 τ exp a ^ 1 1 ( a ^ 2 ) .
The following definition is from Rapcsák [35].
 Definition 3. 
Let V ( ) H n be a geodesic convex set and let a ^ 1 V . Let Θ : V R be a differentiable function. The function Θ is referred to as a geodesic convex function at a ^ 1 V , provided that the inequality stated below is satisfied:
Θ ( a ^ 2 ) Θ ( a ^ 1 ) grad Θ ( a ^ 1 ) , exp a ^ 1 1 ( a ^ 2 ) , a ^ 2 V .
We refer to the function Θ as geodesic concave at a ^ 1 V , if Θ is geodesic convex at a ^ 1 . A function that is both geodesic convex and geodesic concave at a ^ 1 V is said to be a geodesic affine function a ^ 1 .
For any p × q matrix A , the symbol A r represents the r t h row vector of A . In the rest of this section, we consider matrices R ( 1 ) , R ( 2 ) , R ( 3 ) , R ( 4 ) of order p 1 × n , p 2 × n , p 3 × n , and p 4 × n respectively. Let a ^ H n . Suppose that R s ( 1 ) T a ^ H n ( s = 1 , 2 , , p 1 ) , R s ( 2 ) T a ^ H n ( s = 1 , 2 , , p 2 ) , R s ( 3 ) T a ^ H n ( s = 1 , 2 , , p 3 ) , and R s ( 4 ) T a ^ H n ( s = 1 , 2 , , p 4 ) .
The following lemmas are from [36].
 Lemma 1. 
Let us suppose that R ( 1 ) , R ( 2 ) , or R ( 3 ) is non-vacuous. The following systems,
( a ) R s ( 1 ) , ω ¯ a ^ 0 , s = 1 , , p 1 , R s ( 2 ) , ω ¯ a ^ 0 , s = 1 , p 2 , R s ( 3 ) , ω ¯ a ^ 0 , s = 1 , , p 3 , R s ( 4 ) , ω ¯ a ^ = 0 , s = 1 , , p 4 ; ( b ) ( R ( 1 ) ) T u 1 + ( R ( 2 ) ) T u 2 + ( R ( 3 ) ) T u 3 + ( R ( 4 ) ) T u 4 = 0 ; u 1 0 , u 2 0 , u 3 0 ;
provide the solutions ω ¯ T a ^ H n , u 1 R p 1 , u 2 R p 2 , u 3 R p 3 , u 4 R p 4 , satisfying:
R s ( 1 ) , ω ¯ a ^ + u 1 > 0 , s = 1 , 2 , , p 1 , R s ( 2 ) , ω ¯ a ^ + u 2 > 0 , s = 1 , 2 , , p 2 , R s ( 4 ) , ω ¯ a ^ + u 3 > 0 , s = 1 , 2 , , p 3 .
 Lemma 2. 
Let R ( 1 ) be a non-vacuous matrix. One of the following assertions (but not both) holds true:
(a) 
The system of inequalities:
R s ( 1 ) , ω ¯ a ^ > 0 , s = 1 , 2 , , p 1 , R s ( 2 ) , ω ¯ a ^ 0 , s = 1 , 2 , , p 2 , R s ( 3 ) , ω ¯ a ^ = 0 , s = 1 , 2 , , p 3 ,
have a solution ω ¯ T a ^ H n .
(b) 
The following equation,
( R ( 1 ) ) T u 1 + ( R ( 2 ) ) T u 2 + ( R ( 3 ) ) T u 3 = 0
has a solution u 1 R p 1 , u 2 R p 2 , u 3 R p 3 , such that u 1 0 , u 2 0 .
The following lemma is an extension of Tucker’s theorem of alternative in the Hadamard manifold framework.
 Lemma 3. 
Let R ( 1 ) be a non-vacuous matrix. One of the following assertions (but not both) holds true:
(a) 
The system of inequalities,
R s ( 1 ) , ω ¯ a ^ 0 , s = 1 , 2 , , p 1 , R ( 1 ) , ω ¯ a ^ > 0 , for some { 1 , 2 , , p 1 } , R s ( 2 ) , ω ¯ a ^ 0 , s = 1 , 2 , , p 2 , R s ( 3 ) , ω ¯ a ^ = 0 , s = 1 , 2 , , p 3 ,
has a solution ω ¯ T a ^ H n .
(b) 
The following equation,
( R ( 1 ) ) T u 1 + ( R ( 2 ) ) T u 2 + ( R ( 3 ) ) T u 3 = 0
has a solution u 1 R p 1 , u 2 R p 2 , u 3 R p 3 , satisfying u 1 0 , u 2 0 .
 Proof. 
Suppose that statement (a) holds true. By reductio ad absurdum, we suppose that both of the statements (a) and (b) are valid. Consequently, some ω ¯ T a ^ H n exists, satisfying (1). Further, some u 1 R p 1 , u 2 R p 2 , u 3 R p 3 exist, with u 1 0 , u 2 0 , satisfying:
( R ( 1 ) ) T u 1 + ( R ( 2 ) ) T u 2 + ( R ( 3 ) ) T u 3 = 0 .
In light of (1), we have:
R ( 1 ) T u 1 , ω ¯ a ^ + R ( 2 ) T u 2 , ω ¯ a ^ + R ( 3 ) T u 3 , ω ¯ a ^ > 0 ,
which contradicts (2). This establishes the fact that if statement (a) is valid, statement (b) is not satisfied.
On the other hand, we now consider that statement (a) does not hold true. Consider the following system:
R s ( 1 ) , ω ¯ a ^ 0 , s = 1 , 2 , , p 1 , R s ( 2 ) , ω ¯ a ^ 0 , s = 1 , 2 , , p 2 , R s ( 3 ) , ω ¯ a ^ = 0 , s = 1 , 2 , , p 3 .
As a result, for every ω ¯ T a ^ H n , we have:
R s ( 1 ) , ω ¯ a ^ > | 0 , s = 1 , 2 , , p 1 .
Let us now consider the equation:
( R ( 1 ) ) T u 1 + ( R ( 2 ) ) T u 2 + ( R ( 3 ) ) T u 3 = 0 , u 1 , u 2 , u 3 0 ;
In view of Lemma 1, it follows from (4) and (5) that u 1 > 0 . Hence, statement (b) holds true. Thus, the proof is completed. □
For more comprehensive discussions on Hadamard manifolds, we refer to [27,28,37,38,39,40] and the references cited therein.

3. Constraint Qualifications and Necessary Optimality Criteria for MOMPVC

In the rest of the paper, we investigate the following MOMPVC in the Hadamard framework:
( MOMPVC ) Minimize Θ ( z ) = Θ 1 ( z ) , , Θ ( z ) , subject to B r ( z ) 0 , r R B : = { 1 , , s } , C r ( z ) = 0 , r R C : = { 1 , , q } , U r ( z ) 0 , r R : = { 1 , , p } , V r ( z ) U r ( z ) 0 , r R : = { 1 , , p } .
It is assumed that every function involved, that is, Θ r ( r R Θ : = { 1 , , } ) , B r ( r R B ) , C r ( r R C ) , and U r , V r ( r R ) are smooth, scalar-valued functions defined on H n . The symbol S f will be used throughout the rest of the article to indicate the feasible set of MOMPVC. We define a map W r : H n R , as given below:
W r ( a ^ ) : = V r ( a ^ ) U r ( a ^ ) , a ^ H n , r R .
The next definition will be useful in the sequel (see [33]).
 Definition 4. 
A feasible element a ^ S f is said to be a Pareto efficient (weak Pareto efficient, respectively) solution of MOMPVC, if no other a S f exists, for which:
Θ ( a ) Θ ( a ^ ) ( Θ ( a ) Θ ( a ^ ) , respectively ) .
Let a ^ S f . The sets defined below will be employed frequently in this paper:
R a B ( a ^ ) : = { r R B B r ( a ^ ) = 0 } , R + ( a ^ ) : = r R U r ( a ^ ) > 0 , R 0 ( a ^ ) : = r R U r ( a ^ ) = 0 , R + 0 ( a ^ ) : = r R U r ( a ^ ) > 0 , V r ( a ^ ) = 0 , R + ( a ^ ) : = r R U r ( a ^ ) > 0 , V r ( a ^ ) < 0 , R 0 + ( a ^ ) : = r R U r ( a ^ ) = 0 , V r ( a ^ ) > 0 , R 00 ( a ^ ) : = r R U r ( a ^ ) = 0 , V r ( a ^ ) = 0 , R 0 ( a ^ ) : = r R U r ( a ^ ) = 0 , V r ( a ^ ) < 0 .
 Remark 3. 
Every set defined above is dependent on the selection of a ^ S f . However, if such a choice is unambiguous, we shall refrain from indicating it explicitly in the sequel.
Let us now introduce the sets W k ( k R Θ ) and W , which will play a major role in the remaining portion of the present article:
W k : = a S f : Θ r ( a ) Θ r a ^ , r R Θ , r k , W : = a S f : Θ r ( a ) Θ r a ^ , r R Θ .
 Remark 4. 
From the above definitions, it is evident that k R Θ W k = W .
The following notion of contingent cone in the Hadamard manifold framework is from [39].
 Definition 5. 
Let A H n and c ^ cl ( A ) . The Bouligand tangent cone of A at c ^ , represented by C T ( A , c ^ ) , is defined in the following manner:
C T ( A , c ^ ) : = { u T c ^ H n : { s n } n = 1 0 , { u n } n = 1 , u n T c ^ H n , { u n } n = 1 u , exp c ^ ( s n u n ) A , n N } ,
where { s n } n = 1 0 indicates that s n 0 for all n N and { s n } n = 1 tends to 0 as n tends to infinity.
The following definition is an extension of the definition of linearizing cone from Maeda [33] for MOMPVC in the Hadamard manifold framework.
 Definition 6. 
Let a ^ S f . The linearizing cone to the set W at a ^ , signified by L C W , a ^ , is defined as follows:
L C W , a ^ : = { ω ¯ T a ^ H n : grad Θ r a ^ , ω ¯ 0 , r R Θ , grad B r a ^ , ω ¯ 0 , r R a B , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ 0 , r R 0 , grad W r a ^ , ω ¯ 0 , r R 0 R + 0 } .
 Remark 5. 
We observe that grad W r ( a ^ ) = V r ( a ^ ) grad U r ( a ^ ) + U r ( a ^ ) grad V r ( a ^ ) . Then, equivalently, L C W , a ^ may be defined as:
L C W , a ^ : = { ω ¯ T a ^ H n : grad Θ r a ^ , ω ¯ 0 , r R Θ , grad B r a ^ , ω ¯ 0 , r R a B , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ = 0 , r R 0 + , grad U r a ^ , ω ¯ 0 , r R 0 R 00 , grad V r a ^ , ω ¯ 0 , r R + 0 } .
In the following definition, we introduce the definition of the linearizing cone to the set W k ( k R Θ ) at a feasible element of MOMPVC in the Hadamard manifold framework.
 Definition 7. 
Let a ^ S f . The linearizing cone to the set W k ( k R Θ ) at a ^ , signified by L C W k , a ^ , is defined as follows:
L C W k , a ^ : = { ω ¯ T a ^ H n : grad Θ r a ^ , ω ¯ 0 , r R Θ { k } , grad B r a ^ , ω ¯ 0 , r R a B , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ 0 , r R 0 , grad W r a ^ , ω ¯ 0 , r R 0 R + 0 } .
The generalized Guignard constraint qualification (GGCQ) for MOMPVC in the Hadamard manifold framework is introduced in the next definition.
 Definition 8. 
Let a ^ S f . Then, the MOMPVC-tailored generalized Guignard constraint qualification (MOMPVC-GGCQ) holds at a ^ , if:
L C W , a ^ r R Θ cl co C T W r , a ^ .
We now deduce an important result in the next lemma, which will be directly helpful to deduce KKT-type Pareto efficiency conditions for MOMPVC.
 Lemma 4. 
Let a ^ S f , such that MOMPVC-GGCQ holds at a ^ S f . If a ^ is a Pareto efficient solution of MOMPVC, then no ω ¯ T a ^ H n exists, satisfying:
grad Θ r a ^ , ω ¯ 0 , r R Θ , grad Θ r a ^ , ω ¯ < 0 , for at least one r R Θ , grad B r a ^ , ω ¯ 0 , r R a B , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ 0 , r R 0 , grad W r a ^ , ω ¯ 0 , r R 0 R + 0 .
 Proof. 
By reductio ad absurdum, we suppose that some ω ¯ T a ^ H n exists, which satisfies (6). Consequently, in light of Definition 6, it is obvious that ω ¯ L C W , a ^ . Hence, without any loss of generality, we may assume the following:
grad Θ 1 a ^ , ω ¯ < 0 , grad Θ r a ^ , ω ¯ 0 , r R Θ { 1 } .
According to the provided hypotheses, MOMPVC-GGCQ holds at a ^ S f . Hence, the following holds:
ω ¯ cl co C T W 1 , a ^ .
Therefore, some sequence ω ¯ m m = 1 co C T W 1 , a ^ exists, for which lim m ω ¯ m = ω ¯ . Hence, for each element ω ¯ m ( m N ) of the sequence, we have some M m N , satisfying:
k = 1 M m ρ m k = 1 , k = 1 M m ρ m k ω ¯ m k = ω ¯ m ,
where ρ m k R , ρ m k 0 , and ω ¯ m k C T W 1 , a ^ , k = 1 , 2 , , M m . Then, in view of Definition 5, there exist sequences ω ¯ m k n n = 1 , ω ¯ m k n W 1 for each n N and t m k n n = 1 , t m k n ( > 0 ) R for each n N , with t m k n 0 as n , such that:
lim n ω ¯ m k n = ω ¯ m k , exp a ^ ( t m k n ω ¯ m k n ) W 1 .
Let us set x m k n as follows:
x m k n : = exp a ^ ( t m k n ω ¯ m k n ) , n N .
Therefore, we obtain the following inequalities for every n N :
Θ r x m k n = Θ r exp a ^ ( t m k n ω ¯ m k n ) Θ r a ^ , r R Θ { 1 } , B r x m k n = B r exp a ^ ( t m k n ω ¯ m k n ) 0 = B ( a ^ ) , r R a B , C r x m k n = C r exp a ^ ( t m k n ω ¯ m k n ) 0 = C r ( a ^ ) , r R C , U r x m k n = U r exp a ^ ( t m k n ω ¯ m k n ) 0 = U r ( a ^ ) , r R 0 , W r x m k n = W r exp a ^ ( t m k n ω ¯ m k n ) 0 = W r ( a ^ ) , r R 0 R + 0 .
Again, a ^ S f is a Pareto efficient solution of MOMPVC. Therefore:
Θ 1 x m k n = Θ 1 exp a ^ ( t m k n ω ¯ m k n ) Θ 1 a ^ , n N .
By employing the Taylor series of Θ r at a ^ , for each r R Θ { 1 } , we obtain:
Θ r exp a ^ ( t m k n ω ¯ m k n ) = Θ r ( a ^ ) + t m k n grad Θ r ( a ^ , ω ¯ m k n + o t m k n .
Then, it follows that for every r R Θ { 1 } , we have:
Θ r exp a ^ ( t m k n ω ¯ m k n ) Θ r ( a ^ ) t m k n = grad Θ r ( a ^ ) , ω ¯ m k n + o t m k n t m k n .
We observe that Θ r x m k n = Θ r exp a ^ ( t m k n ω ¯ m k n ) Θ r a ^ , for every r R Θ { 1 } . Hence, by letting t m k n 0 , it follows from Equation (12) that
grad Θ r a ^ , ω ¯ m k 0 , r R Θ { 1 } .
Continuing similarly as before, we arrive at the following:
grad Θ 1 a ^ , ω ¯ m k 0 , grad Θ r a ^ , ω ¯ m k 0 , r R Θ { 1 } , grad B r a ^ , ω ¯ m k 0 , r R a B , grad C r a ^ , ω ¯ m k = 0 , r R C , grad U r a ^ , ω ¯ m k 0 , r R 0 , grad W r a ^ , ω ¯ m k 0 , r R 0 R + 0 .
In light of the continuity property of inner product, we have the following:
grad Θ 1 a ^ , ω ¯ 0 , grad Θ r a ^ , ω ¯ 0 , r R Θ { 1 } , grad B r a ^ , ω ¯ 0 , r R a B , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ 0 , r R 0 , grad W r a ^ , ω ¯ 0 , r R 0 R + 0 ,
which contradicts our initial assumption. Hence, the proof is completed. □
 Remark 6. 
Theorem 4 is a generalization of Theorem 3.1 of Maeda [33] from multiobjective optimization problems to MOMPVC, and further, extends it from the linear setting of R n to the nonlinear Hadamard manifold framework.
Now, we employ MOMPVC-GGCQ to derive KKT-type necessary Pareto efficiency criteria for MOMPVC.
 Theorem 1. 
Let a ^ S f be a Pareto efficient solution of MOMPVC at which MOMPVC-GGCQ holds. Then, some real numbers, α r ( r R Θ ) , σ r B ( r R B ) , σ r C ( r R C ) , σ r U ( r R ) , σ r V ( r R ) , exist, which satisfy the following:
r R Θ α r grad Θ r a ^ + r R B σ r B grad B r a ^ + r R C σ r C grad C r a ^ r R σ r U grad U r a ^ + r R σ r V grad V r a ^ = 0 ,
and
α r > 0 , r R Θ , B r a ^ 0 , σ r B 0 , σ r B B r a ^ = 0 , r R B , C r a ^ = 0 , r R C , σ r U free , r R 0 + , σ r U 0 , r R 00 R 0 , σ r U = 0 , r R + , σ r V 0 , r R + 0 , σ r V = 0 , r R 0 R + , σ r U U r a ^ = 0 , σ r V V r a ^ = 0 , r R .
 Proof. 
According to the provided hypotheses, a ^ S f is a Pareto efficient solution of MOMPVC and MOMPVC-GGCQ holds at a ^ . In light of Lemma 4, it follows that system (6) has no solution ω ¯ T a ^ H n . Now, by invoking Lemma 3, we infer that there exist real numbers, α r > 0 ( r R Θ ) , σ r B 0 ( r R a B ) , σ r C + 0 , σ r C 0 ( r R C ) , β r U 0 ( r R 0 ) , σ r W 0 ( r R 0 R + 0 ) , which satisfy the following:
r R Θ α r grad Θ r a ^ + r R a B σ r B grad B r a ^ + r R C σ r C + grad C r a ^ r R C σ r C grad C r a ^ r R 0 β r U grad U r a ^ + r R 0 R + 0 σ r W grad W r a ^ = 0 .
Let us set σ r B = 0 ( r R a B ), β r U = 0 ( r R 0 ), σ r W = 0 ( r R 0 R + 0 ). Then, it follows that:
r R Θ α r grad Θ r a ^ + r R B σ r B grad B r a ^ + r R C σ r C + grad C r a ^ r R C σ r C grad C r a ^ r R β r U grad U r a ^ + r R σ r W grad W r a ^ = 0 ,
On the other hand, B r a ^ = 0 r R a B , C r ( a ^ ) = 0 , r R C , U r a ^ = 0 r R 0 , and W r a ^ = 0 r R 0 R + 0 . This entails that:
σ r B B r a ^ = 0 , r R B , σ r C + C r a ^ = 0 , r R C , σ r C C r a ^ = 0 , r R C , β r U U r a ^ = 0 , r R , σ r W W r a ^ = 0 , r R .
Let us set the following:
σ r C + σ r C = σ r C , r R C , β r U σ r W V r a ^ = σ r U , r R , σ r W U r a ^ = σ r V , r R .
Consequently, we arrive at the following:
r R Θ α r grad Θ r a ^ + r R B σ r B grad B r a ^ + r R C σ r C grad C r a ^ r R σ r U grad U r a ^ + r R σ r V grad V r a ^ = 0 ,
and
α r > 0 , r R Θ , B r a ^ 0 , σ r B 0 , σ r B B r a ^ = 0 , r R B , C r a ^ = 0 , r R C , σ r U free , r R 0 + , σ r U 0 , r R 00 R 0 , σ r U = 0 , r R + , σ r V 0 , r R + 0 , σ r V = 0 , r R 0 R + , σ r U U r a ^ = 0 , σ r V V r a ^ = 0 , r R .
Thus, the proof is completed. □
 Remark 7. 
  • If H n = R n , Theorem 1 reduces to Theorem 6.2 established by Mishra et al. [12].
  • Theorem 1 is a generalization of Theorem 3.2 derived by Maeda [33] from multiobjective optimization problems in the setting of R n to MOMPVC in the Hadamard manifold framework.
We now provide an illustrative example to demonstrate that MOMPVC-GGCQ is not a sufficient condition for Theorem 1.
 Example 1. 
Let M 2 signify the set of all 2 × 2 symmetric matrices. Let M + 2 M 2 consist of 2 × 2 positive definite matrices. A M + 2 . M + 2 is a well-known Hadamard manifold (see [40]), with:
W 1 , W 2 A : = Tr ( W 2 A 1 W 1 A 1 ) ,
for any arbitrary W 1 , W 2 T A M + 2 = M 2 . Let A , B M + 2 and W T A M + 2 .
The exponential map exp A ( W ) : T A M + 2 M + 2 is given by
exp A ( W ) = A 1 2 Exp A 1 2 W A 1 2 A 1 2 ,
where Exp denotes the usual matrix exponential. The inverse exponential map exp A 1 : M + 2 T A M + 2 is:
exp A 1 ( B ) = A 1 2 Log A 1 2 B A 1 2 A 1 2 ,
where Log denotes standard logarithm on M + 2 (see [40]). Let F : M + 2 R . Then,
grad ( F ( A ) ) = A F ( A ) A ,
where A M 2 + and F ( U ) signifies the Euclidean gradient of F at U (see [40]).
We formulate a MOMPVC, denoted by (P) for the sake of brevity, as follows:
( P ) Minimize Θ ( A ) = ( Θ 1 ( A ) , Θ 2 ( A ) ) : = ( 3 log a 1 3 log a 4 , 5 log a 1 log a 4 ) , subject to B 1 ( A ) : = | a 4 | 1 0 , B 2 ( A ) : = | a 1 | 1 0 , U ( A ) : = a 2 2 0 , U ( A ) V ( A ) : = ( a 2 2 ) ( a 3 2 ) 0 ,
where Θ i : M 2 + R ( i = 1 , 2 ) and B j : M 2 + R ( j = 1 , 2 ) , and U , V : M 2 + R real valued functions and A = a 1 a 2 a 2 a 4 M 2 + .
Let S f signify the feasible set of (P). Then:
S f : = a 1 0 0 a 4 : 0 < a 1 1 , 0 < a 4 1 .
We choose the feasible element
A * = 1 0 0 1 S f .
It can be verified that:
L C ( W , A * ) = 0 a 2 a 2 0 : a 2 R , C T ( W r , A * ) = a 1 a 2 a 3 a 4 : a 1 , a 2 , a 3 , a 4 = 0 , r = 1 , 2 .
Therefore, MOMPVC-GGCQ is not satisfied at A * . Moreover, we can obtain the following:
grad Θ 1 ( A * ) = 3 0 0 3 , grad Θ 2 ( A * ) = 1 0 0 1 , grad B 1 ( A * ) = 0 0 0 1 , grad B 2 ( A * ) = 1 0 0 0 , grad U ( A * ) = 0 0 0 0 , grad V ( A * ) = 0 0 0 0 .
Then, there exists σ 1 Θ = 1 2 , σ 2 Θ = 1 2 , σ 1 B = 1 , σ 2 B = 1 , σ C = 1 , σ D = 1 , such that
σ 1 Θ 1 0 0 1 + σ 2 Θ 1 0 0 1 + σ 1 B 0 0 0 1 + σ 2 B 1 0 0 0 σ C 0 0 0 0 + σ D 0 0 0 0 = 0 0 0 0 .
As a result, we infer the fact that although MOMPVC-GGCQ fails to be satisfied at A * , KKT conditions still hold.

4. Sufficient Conditions for MOMPVC-GGCQ

In this section, we investigate several constraint qualifications existing in the literature in the framework of Hadamard manifolds for MOMPVC. We further derive certain sufficient conditions for MOMPVC-GGCQ.
The following definition is extended from Mishra et al. [12] for MOMPVC in the Hadamard manifold framework.
 Definition 9. 
Let a ^ S f . We say that the Cottle-type constraint qualification (CTCQ) holds at a ^ if for every k R Θ , the following system provides a solution, ω ¯ T a ^ H n :
grad Θ r a ^ , ω ¯ < 0 , r R Θ and r k , grad B r a ^ , ω ¯ < 0 , r R a B a ^ , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ > 0 , r R 0 + R 00 R 0 , grad W r a ^ , ω ¯ < 0 , r R 0 + R 00 R 0 R + 0 .
In the following lemma, we demonstrate that under some mild restrictions on the index sets, CTCQ is not satisfied as a feasible element of MOMPVC.
 Lemma 5. 
Let a ^ S f and R 00 R 0 + ϕ . Then, CTCQ does not hold at a ^ .
 Proof. 
By reductio ad absurdum, we suppose that CTCQ holds at a ^ . As a result, for every k R Θ , the system (22) provides a solution, ω ¯ T a ^ H n . From the definitions of the index sets, we obtain
grad W r a ^ = 0 , r R 00 , grad U r a ^ , ω ¯ = 1 V r a ^ grad W r a ^ , ω ¯ < 0 , r R 0 + ,
which contradicts (22). Hence, the proof is completed. □
We now modify several standard constraint qualifications and introduce the following MOMPVC-tailored constraint qualifications on Hadamard manifolds. In the following definitions, we always assume that a ^ S f .
 Definition 10. 
The MOMPVC-tailored Abadie’s constraint qualification (MOMPVC-ACQ) holds at a ^ , if:
L C W , a ^ C T W , a ^ .
 Definition 11. 
The MOMPVC-tailored generalized Abadie’s constraint qualification (MOMPVC-GACQ) holds at a ^ , if:
L C W , a ^ i R Θ C T W i ; a ^ .
 Lemma 6. 
If MOMPVC-ACQ holds at a ^ , then MOMPVC-GACQ holds at a ^ .
 Proof. 
The proof follows readily from Definitions 10 and 11. □
 Lemma 7. 
If MOMPVC-GACQ holds at a ^ , then MOMPVC-GGCQ holds at a ^ .
 Proof. 
The proof follows readily from Definitions 10 and 11. □
 Definition 12. 
The MOMPVC-tailored Cottle-type constraint qualification (MOMPVC-CTCQ) holds at a ^ , if for every k R Θ , the following system provides a solution, ω ¯ T a ^ H n :
grad Θ r a ^ , ω ¯ < 0 , r R Θ and r k , grad B r a ^ , ω ¯ < 0 , r R a B a ^ , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ = 0 , r R 0 + R 00 , grad U r a ^ , ω ¯ > 0 , r R 0 , grad V r a ^ , ω ¯ < 0 , r R + 0 .
 Definition 13. 
The MOMPVC-tailored Slater-type constraint qualification (MOMPVC-STCQ) holds at a ^ if Θ r ( r R Θ ), and B r ( r R B ) , V r ( r R + 0 ) are geodesic convex, U r ( r R 0 ) are geodesic concave, U r ( r R 00 R 0 + ) , C r ( r R C ) are geodesic affine, and for every k R Θ , the following system provides a solution, z H n :
Θ r ( z ) < Θ r a ^ , r R Θ and r k , B r ( z ) < 0 , r R a B ( a ^ ) , C r ( z ) = 0 , r R C , U r ( z ) = 0 , r R 00 R 0 + , U r ( z ) > 0 , r R 0 , V r ( z ) < 0 , r R + 0 .
 Definition 14. 
The MOMPVC-tailored Mangasarian–Fromovitz constraint qualification (MOMPVC-MFCQ) holds at a ^ if grad Θ r ( r R Θ ) , grad C r ( r R C ) , grad U r ( r R 0 + R 00 ) are linearly independent and the following system provides a solution, ω ¯ T a ^ H n :
grad Θ r a ^ , ω ¯ = 0 , r R Θ , grad B r a ^ , ω ¯ < 0 , r R a B a ^ , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ = 0 , r R 0 + R 00 , grad U r a ^ , ω ¯ > 0 , r R 0 , grad V r a ^ , ω ¯ < 0 , r R + 0 .
 Definition 15. 
Let a ^ S f . Then the linearly independent constraint qualification (MOMPVC-LICQ) is said to hold at a ^ , if for every k R Θ , the gradients grad Θ r a ^ r R Θ , r k , grad B r a ^ r R a B , grad C r a ^ r R C , grad U r a ^ r R 0 , grad V r a ^ r R + 0 are linearly independent.
In the following theorem, we establish that the satisfaction of MOMPVC-CTCQ is a sufficient condition for the satisfaction of MOMPVC-GGCQ under certain reasonable restriction on index sets.
 Lemma 8. 
Let a ^ S f . Suppose that R 00 = ϕ . If MOMPVC-CTCQ holds at a ^ , then MOMPVC-GGCQ also holds at a ^ .
 Proof. 
According to the provided hypotheses, a ^ S f and R 00 = ϕ . Further, CTCQ holds at a ^ S f . As a result, some ω ¯ T a ^ H n exists, such that, for every k R Θ , we have:
grad Θ r a ^ , ω ¯ < 0 , r R Θ and r k , grad B r a ^ , ω ¯ < 0 , r R a B a ^ , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ = 0 , r R 0 + , grad U r a ^ , ω ¯ > 0 , r R 0 , grad V r a ^ , ω ¯ < 0 , r R + 0 .
Let v L C W , a ^ . Then, in view of Definition 6 and the fact that R 00 = ϕ , we get:
grad Θ r a ^ , v 0 , r R Θ , grad B r a ^ , v 0 , r R a B ( a ^ ) , grad C r a ^ , v = 0 , r R C , grad U r a ^ , v = 0 , r R 0 + , grad U r a ^ , v 0 , r R 0 , grad V r a ^ , v 0 , r R + 0 .
At first, we claim that v C T W 1 , a ^ . Consider a sequence τ n n = 1 0 , where 0 indicates that the sequence approaches zero from the positive direction. Correspondingly, we define v n n = 1 as follows:
v n : = v + τ n ω ¯ , n N .
Clearly, v n v as n . From (29), (30), and (31), it follows that
grad Θ r a ^ , v n < 0 , r R Θ , grad B r a ^ , v n < 0 , r R a B ( a ^ ) , grad C r a ^ , v n = 0 , r R C , grad U r a ^ , v n = 0 , r R 0 + grad U r a ^ , v n > 0 , r R 0 , grad V r a ^ , v n < 0 , r R + 0 .
For every element of the sequence { v n } ( n N ), we consider a sequence λ n k k = 1 0 . Now, we construct a sequence z n k k = 1 as:
z n k : = exp a ^ ( λ n k v n ) , k N .
Clearly { z n k } a ^ as k . Then, for large enough k, we have the following for every r R Θ { 1 } :
Θ r z n k = Θ r a ^ + λ n k grad Θ r a ^ , v n + o λ n k < Θ r a ^ .
Similarly, for large enough k, we have the following for every r R a B a ^ :
B r z n k = B r a ^ + λ n k grad B r a ^ , v n + o λ n < B r a ^ = 0 .
Now, for every r R a B a ^ , it follows from the continuity of B r that
B r z n k = B r exp a ^ ( λ n k v n ) < 0 , for sufficiently large k .
Continuing in a similar manner, it can be shown that for large enough k, we have:
C r ( z n k ) = 0 , r R C , U r ( z n k ) = 0 , r R , U r ( z n k ) 0 , r R , V r ( z n k ) 0 , r R .
Since R 00 = ϕ , then it follows from (34)–(37) that
z n k = exp a ^ ( λ n k v n ) W 1 , for sufficiently large k .
Without any loss of generality, we may assume that z n k W 1 for all k. This implies that
v C T W 1 , a ^ .
By following exactly the same procedure, we can show that for every k R Θ { 1 } , we have v C T W k , a ^ . Then, it follows that
v k R Θ C T W k , a ^ k R Θ cl co C T W k , a ^ .
Hence, the proof is completed. □
In the following lemma, we provide a relation between MOMPVC-CTCQ and MOMPVC-MFCQ.
 Lemma 9. 
Let a ^ S f . If MOMPVC-MFCQ holds at a ^ , then MOMPVC-CTCQ is also satisfied at a ^ .
 Proof. 
According to the provided hypotheses, MOMPVC-MFCQ holds at a ^ S f . This implies that grad Θ r ( r R Θ ) , grad C r ( r R C ) , grad U r ( r R 0 + R 00 ) are linearly independent. Moreover, some ω ¯ T a ^ H n exists, satisfying:
grad Θ r a ^ , ω ¯ = 0 , r R Θ , grad B r a ^ , ω ¯ < 0 , r R a B a ^ , grad C r a ^ , ω ¯ = 0 , r R C , grad U r a ^ , ω ¯ = 0 , r R 0 + R 00 , grad U r a ^ , ω ¯ > 0 , r R 0 , grad V r a ^ , ω ¯ < 0 , r R + 0 .
By reductio ad absurdum, let us assume that MOMPVC-CTCQ is not satisfied at a ^ S f . Then, some k R Θ exists, such that the system given below does not provide a solution, v T a ^ H n :
grad Θ r a ^ , v < 0 , r R Θ and r k , grad B r a ^ , v < 0 , r R a B a ^ , grad C r a ^ , v = 0 , r R C , grad U r a ^ , v = 0 , r R 0 + R 00 , grad U r a ^ , v > 0 , r R 0 , grad V r a ^ , v < 0 , r R + 0 .
In view of Lemma 2 and (42), some real numbers, α r 0 r R Θ , r k , σ r B 0 r R a B , σ r U 0 r R 0 , σ r V 0 r R + 0 , not all zero, and σ r C r R C , σ ˜ r U r R 0 + R 00 , exist, for which:
r R Θ r k α r grad Θ r a ^ + r R a B σ r B grad B r a ^ + r R C σ r C grad C r a ^ + r R 00 R 0 + σ ˜ r U grad U r a ^ r R 0 σ r U grad U r a ^ + r R + 0 σ r V grad V r a ^ = 0 .
From (41) and (43), it follows that:
r R a B σ r B grad B r a ^ , ω ¯ r R 0 σ r U grad U r a ^ , ω ¯ + r R + 0 σ r V grad V r a ^ , ω ¯ = 0 .
Combining (41) and (44), we yield: σ r B = 0 , r R a B , σ r U = 0 , r R 0 , σ r V = 0 , r R + 0 . Then, it follows from (43) that
r R Θ r k α r grad Θ r a ^ + r R C σ r C grad C r a ^ r R 00 R 0 + σ ˜ r U grad C r a ^ = 0 .
From the linearly independence of grad Θ r a ^ r R Θ , grad C r a ^ r R C , grad U r a ^ r R 00 R 0 + , we infer that:
α r = 0 , r R Θ , r k , σ r C = 0 , r R C , σ ˜ r U = 0 , r R 00 R 0 + ,
which is a contradiction. Hence, the proof is completed. □
In the following lemma, we provide a relation between MOMPVC-CTCQ and MOMPVC-STCQ.
 Lemma 10. 
Let a ^ S f . If MOMPVC-STCQ holds at a ^ , then MOMPVC-CTCQ also holds at a ^ .
 Proof. 
From the provided hypotheses, MOMPVC-STCQ holds at a ^ S f . Then, it follows that each of the functions Θ r ( r R Θ ) B r ( r R B ) and V r ( r R + 0 ) are geodesic convex, U r ( r R 0 ) are geodesic concave, U r ( r R 00 R 0 + ) , C r ( r R C ) are affine, and for every k R Θ , the system of inequalities given below,
Θ r ( z ) < Θ r a ^ , r R Θ and r k , B r ( z ) < 0 , r R a B ( a ^ ) , C r ( z ) = 0 , r R C , U r ( z ) = 0 , r R 00 R 0 + , U r ( z ) > 0 , r R 0 , V r ( z ) < 0 , r R + 0 .
provides a solution, z k H n . Then, it follows that
grad Θ r a ^ , exp a ^ 1 ( z k ) Θ r z k Θ r a ^ < 0 , r R Θ , r k , grad B r a ^ , exp a ^ 1 ( z k ) B r z k B r a ^ < 0 , r R a B ( a ^ ) , grad C r a ^ , exp a ^ 1 ( z k ) = C r z k C r a ^ = 0 , r R C , grad U r a ^ , exp a ^ 1 ( z k ) = U r z k U r a ^ = 0 , r R 00 R 0 + , grad U r a ^ , exp a ^ 1 ( z k ) U r z k U r a ^ > 0 , r R 0 , grad V r a ^ , exp a ^ 1 ( z k ) V r z k V r a ^ < 0 , r R + 0 .
Let us define v k : = exp a ^ 1 ( z k ) . Then, it follows that for every k R Θ , we have the following
grad Θ r a ^ , v k < 0 , r R Θ and r k , grad B r a ^ , v k < 0 , r R a B a ^ , grad C r a ^ , v k = 0 , r R C , grad U r a ^ , v k = 0 , r R 0 + R 00 , grad U r a ^ , v k > 0 , r R 0 , grad V r a ^ , v k < 0 , r R + 0 .
Therefore, from the above inequalities it follows that MOMPVC-CTCQ holds at a ^ S f . Hence, the proof is completed. □
The results derived in this section are summarized in the following theorem.
 Theorem 2. 
Let a ^ S f be a Pareto efficient solution of MOMPVC and let R 00 = ϕ . If any of the constraint qualifications as defined in Definitions 10–15 holds at a ^ , then MOMPVC-GGCQ holds at a ^ , and there exist real numbers, α r ( r R Θ ) , σ r B ( r R B ) , σ r C ( r R C ) , σ r U ( r R ) , σ r V ( r R ) , which satisfy (16) and (17).
 Remark 8. 
  • If H n = R n , Theorem 2 reduces to Theorem 6.3 derived by Mishra et al. [12].
  • Theorem 2 generalizes Theorem 4.1 of Maeda [33] from multiobjective optimization problems to MOMPVC and extends it from the linear setting of Euclidean spaces to the nonlinear Hadamard manifold framework.
We now provide an illustrative example to demonstrate that MOMPVC-GACQ is not a sufficient condition for Theorem 1.
 Example 2. 
Consider H 2 R 2 , commonly known as the positive orthant of R 2 , defined as:
H 2 : = { a = ( a 1 , a 2 ) R 2 : a 1 , a 2 > 0 } .
Then, H 2 is a Hadamard manifold (see [35]). Let a ^ H 2 . Then, s 1 , s 2 a ^ = B ( a ^ ) s 1 , s 2 , s 1 , s 2 T a ^ H n = R 2 , where
B ( a ^ ) = 1 a ^ 1 2 0 0 1 a ^ 2 2 .
Let s T a ^ H 2 . Then, exp a ^ : T a ^ H 2 H 2 is defined as exp a ^ ( s ) = ( a ^ 1 e s 1 a ^ 1 , a ^ 2 e s 2 a ^ 2 ) , s = ( s 1 , s 2 ) T a ^ H 2 .
Consider the following MOMPVC on H 2 :
( P 1 ) Minimize Θ ( a ) = ( Θ 1 ( a ) , Θ 2 ( a ) ) : = ( a 1 , log a 2 ) , subject to U ( a ) : = ln a 1 1 0 , V ( a ) T U ( a ) : = ( e a 2 ) ( ln a 1 1 ) 0 ,
where Θ r : H 2 R ( r = 1 , 2 ) , U : H 2 R , V : H 2 R are differentiable. The feasible set of ( P 1 ), denoted by S f , is:
S f : = { a H 2 : a 1 e , a 2 e } .
Let a ^ = ( e , e ) S f . The following expressions can be easily obtained:
grad Θ 1 ( a ) = B ( a ) 1 1 2 a 1 0 = 1 2 a 1 a 1 0 , grad Θ 2 ( a ) = B ( a ) 1 0 1 a 2 = 0 a 2 , grad U ( a ) = B ( a ) 1 1 a 1 0 = a 1 0 , grad V ( a ) = B ( a ) 1 0 1 = 0 a 2 2 .
In view of the above expressions, one can see that:
L C ( W , a ^ ) = { s = ( s 1 , s 2 ) R 2 : s 1 = 0 , s 2 0 } , C T ( W 1 , a ^ ) = { s = ( s 1 , s 2 ) R 2 : s 1 0 , s 2 = 0 } , C T ( W 2 , a ^ ) = { s = ( s 1 , s 2 ) R 2 : s 1 = 0 , s 2 0 } .
As a result, we have:
i = 1 2 cl co C T W i , a ^ = { ( 0 , 0 ) } .
Therefore, MOMPVC-GACQ fails to be satisfied at the point a ^ . However, there exist α 1 = 1 2 , α 2 = 1 2 , σ U = e 4 , σ V = 1 2 e , satisfying:
r = 1 2 α r grad Θ r a ^ σ U grad U a ^ + σ V grad V a ^ = ( 0 , 0 ) .
Thus, it is verified that the satisfaction of MOMPVC-GACQ is not a sufficient condition for Theorem 1.
The interrelations among the various constraint qualifications for MOMPVC is illustrated in Figure 1.

5. Conclusions and Future Research Directions

In this paper, we have investigated a class of MOMPVC in the Hadamard manifold framework. We have presented the MOMPVC-GGCQ for MOMPVC on Hadamard manifolds. Employing MOMPVC-GGCQ, we have deduced the KKT-type necessary optimality criteria for MOMPVC. Subsequently, we have introduced several MOMPVC-tailored constraint qualifications, which are sufficient criteria for MOMPVC-GGCQ. To validate the results derived in this paper, we have provided non-trivial illustrative examples in the setting of well-known Hadamard manifolds.
Several notable results currently existing in the literature are generalized and extended by the results presented in this article. For instance, the KKT-type necessary optimality conditions established in this paper extend the corresponding optimality criteria deduced by Mishra et al. [12] from the setting of Euclidean spaces to the Hadamard manifold framework. On the other hand, the results presented in this paper extend the corresponding results studied by Hoheisel and Kanzow [9] from Euclidean space to Hadamard manifolds and generalize them from MPVC to MOMPVC. Furthermore, we have extended the constraint qualifications and Pareto efficiency conditions investigated by Maeda [33] from multiobjective optimization problems to MOMPVC and have further generalized them from the Euclidean space setting to the framework of Hadamard manifolds.
The results derived in the present manuscript may be applied to solve real-life optimization problems in engineering, science, and technology. It is a well-known fact that various real-world problems emerging in various areas of modern research, such as truss optimization (see [1]), robot motion planning (see [5]), and optimal pressure control in water distribution system (see [16]), can be formulated as MPVC. In our future research work, we intend to formulate a real-world practical problem in terms of an MOMPVC on Hadamard manifolds and solve it by employing the constraint qualifications and optimality conditions for MOMPVC established in the present paper.
It is significant to observe that all the functions involved in our considered problem (MOMPVC) are assumed to be differentiable. As a result, the results of this paper cannot be applied when the functions involved in the considered problem are not necessarily differentiable. This may be considered as a limitation of this paper. Further, sufficient optimality criteria and duality results have not been investigated in the present article. We intend to address these issues in our future course of study.
It is worthwhile to note that, in the framework of Hadamard manifolds, numerical methods for solving mathematical programming problems with vanishing constraints have not yet been investigated. The framework of Hadamard manifolds is advantageous due to the fact that various constrained, non-convex optimization problems in the Euclidean space setting can be suitably transformed into unconstrained and convex optimization problems in the Hadamard manifold framework (see [23]). Moreover, it is a well-known fact that in the case of numerical methods, in order to prove convergence, the satisfaction of a constraint qualification, such as the Mangasarian–Fromovitz constraint qualification (MFCQ), must be assumed at a limit point of the sequence generated by the corresponding numerical method. In light of these facts, following the works of [2,3], the constraint qualifications for MOMPVC on Hadamard manifolds developed in this paper can be employed to investigate numerical methods, such as the relaxation approach and the one-parameter regularization methods for solving MOMPVC in the framework of Hadamard manifolds. We intend to study these numerical methods for MOMPVC in the setting of Hadamard manifolds in our future research works and, moreover, analyze the convergence of the corresponding methods.

Author Contributions

Conceptualization, B.B.U., A.G. and J.-C.Y.; Funding acquisition, J.-C.Y.; Investigation, S.T.; Methodology, A.G.; Supervision, B.B.U., S.T. and J.-C.Y. All authors contributed equally to this article. All authors have read and agreed to the submitted version of the manuscript.

Funding

Arnav Ghosh is supported by the Council of Scientific and Industrial Research (CSIR), New Delhi, India, through grant number 09/1023(0044)/2021-EMR-I. Jen-Chih Yao was partially supported by the Grant MOST-113-2115-M-039-001.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The authors declare that no data, text, or theories by others are presented in this paper without proper acknowledgments.

Acknowledgments

The authors would like to thank the anonymous referees for their careful reading of the paper and constructive suggestions that have substantially improved the manuscript.

Conflicts of Interest

The authors declare that there are no actual or potential conflicts of interest in relation to this article.

References

  1. Achtziger, W.; Kanzow, C. Mathematical programs with vanishing constraints: Optimality conditions and constraint qualifications. Math. Program. 2007, 114, 69–99. [Google Scholar] [CrossRef]
  2. Hoheisel, T. Mathematical Programs with Vanishing Constraints. Ph.D. Thesis, University of Würzburg, Würzburg, Germany, 2009. [Google Scholar]
  3. Hoheisel, T.; Pablos, B.; Pooladian, A.; Schwartz, A.; Steverango, L. A study of one-parameter regularization methods for mathematical programs with vanishing constraints. Optim. Methods Softw. 2022, 37, 503–545. [Google Scholar] [CrossRef]
  4. Hoheisel, T.; Kanzow, C. First- and second-order optimality conditions for mathematical programs with vanishing constraints. Appl. Math. 2007, 52, 495–514. [Google Scholar] [CrossRef]
  5. Dai, P.D. Mathematical program with vanishing constraints for optimal pressure control in water distribution systems. J. Water Manag. Model. 2024, 32, C515. [Google Scholar] [CrossRef]
  6. Kirches, C.; Potschka, A.; Bock, H.G.; Sager, S. A parametric active set method for quadratic programs with vanishing constraints. Pac. J. Optim. 2012, 9, 275–299. [Google Scholar]
  7. Tung, L.T. Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints. Ann. Oper. Res. 2022, 311, 1307–1334. [Google Scholar] [CrossRef]
  8. Hoheisel, T.; Kanzow, C. Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J. Math. Anal. Appl. 2008, 337, 292–310. [Google Scholar] [CrossRef]
  9. Hoheisel, T.; Kanzow, C. On the Abadie and Guignard constraint qualifications for mathematical programmes with vanishing constraints. Optimization 2009, 58, 431–448. [Google Scholar] [CrossRef]
  10. Antczak, T. On directionally differentiable multiobjective programming problems with vanishing constraints. Ann. Oper. Res. 2023, 328, 1181–1212. [Google Scholar] [CrossRef]
  11. Guu, S.M.; Singh, Y.; Mishra, S.K. On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints. J. Inequalities Appl. 2017, 2017, 282. [Google Scholar] [CrossRef] [PubMed]
  12. Mishra, S.K.; Singh, V.; Laha, V.; Mohapatra, R.N. On constraint qualifications for multiobjective optimization problems with vanishing constraints. In Optimization Methods, Theory and Applications; Xu, H., Wang, S., Wu, S.Y., Eds.; Springer: Berlin/Heidelberg, Germany, 2015; pp. 95–135. [Google Scholar]
  13. Mishra, S.K.; Singh, V.; Laha, V. On duality for mathematical programs with vanishing constraints. Ann. Oper. Res. 2016, 243, 249–272. [Google Scholar] [CrossRef]
  14. Upadhyay, B.B.; Ghosh, A. On constraint qualifications for mathematical programming problems with vanishing constraints on Hadamard manifolds. J. Optim. Theory Appl. 2023, 199, 1–35. [Google Scholar] [CrossRef]
  15. Shirdel, G.H.; Zeinali, M.; Ansari Ardali, A. Some non-smooth optimality results for optimization problems with vanishing constraints via Dini–Hadamard derivative. J. Appl. Math. Comput. 2022, 68, 4099–4118. [Google Scholar] [CrossRef]
  16. Hassan, M.; Maurya, J.K.; Mishra, S.K. On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints. Bull. Malays. Math. Sci. Soc. 2022, 45, 1315–1341. [Google Scholar] [CrossRef]
  17. Upadhyay, B.B.; Ghosh, A.; Treanţă, S. Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints on Hadamard manifolds. J. Math. Anal. Appl. 2024, 531, 127785. [Google Scholar] [CrossRef]
  18. Absil, P.-A.; Baker, C.G.; Gallivan, K.A. Trust-region methods on Riemannian manifolds. Found. Comput. Math. 2007, 7, 303–330. [Google Scholar] [CrossRef]
  19. Belkin, M.; Niyogi, P. Semi-supervised learning on Riemannian manifolds. Mach. Learn. 2004, 56, 209–239. [Google Scholar] [CrossRef]
  20. Treanţă, S.; Upadhyay, B.B.; Ghosh, A.; Nonlaopon, K. Optimality conditions for multiobjective mathematical programming problems with equilibrium constraints on Hadamard manifolds. Mathematics 2022, 10, 3516. [Google Scholar] [CrossRef]
  21. Boumal, N.; Mishra, B.; Absil, P.-A.; Sepulchre, R. Manopt, a Matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 2014, 15, 1455–1459. [Google Scholar]
  22. Pennec, X. Manifold-valued image processing with SPD matrices. In Riemannian Geometric Statistics in Medical Image Analysis; Pennec, X., Sommer, S., Fletcher, T., Eds.; Elsevier: Amsterdam, The Netherlands, 2020; pp. 75–134. [Google Scholar]
  23. Udrişte, C. Convex Functions and Optimization Methods on Riemannian Manifolds; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  24. Papa Quiroz, E.A.; Baygorrea Cusihuallpa, N.; Maculan, N. Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds. J. Optim. Theory Appl. 2020, 186, 879–898. [Google Scholar] [CrossRef]
  25. Upadhyay, B.B.; Ghosh, A.; Treanţă, S. Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds. Bull. Iran. Math. Soc. 2023, 49, 1–36. [Google Scholar] [CrossRef]
  26. Upadhyay, B.B.; Ghosh, A.; Treanţă, S. Constraint qualifications and optimality criteria for nonsmooth multiobjective optimization problems on Hadamard manifolds. J. Optim. Theory Appl. 2024, 200, 794–819. [Google Scholar] [CrossRef]
  27. Upadhyay, B.B.; Ghosh, A. Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds. Positivity 2024, 28, 1–26. [Google Scholar] [CrossRef]
  28. Upadhyay, B.B.; Ghosh, A.; Kanzi, N.; Soroush, H. Constraint qualifications for nonsmooth multiobjective programming Problems with switching constraints on Hadamard manifolds. Bull. Malays. Math. Sci. Soc. 2024, 47, 103. [Google Scholar] [CrossRef]
  29. Kristály, A.; Li, C.; Loṕez-Acedo, G.; Nicolae, A. What do ‘convexities’ imply on Hadamard manifolds? J. Optim. Theory Appl. 2016, 170, 1068–1074. [Google Scholar] [CrossRef]
  30. Wang, J.; Wang, X.; Li, C.; Yao, J.C. Convergence analysis of gradient algorithms on Riemannian manifolds without curvature constraints and application to Riemannian mass. SIAM J. Optim. 2021, 31, 172–199. [Google Scholar] [CrossRef]
  31. Han, W.; Yu, G. Optimality and error bound for set optimization with application to uncertain multi-objective programming. J. Glob. Optim. 2024, 88, 979–998. [Google Scholar] [CrossRef]
  32. Melo, A.S.; Dos Santos, L.B.; Rojas-Medar, M.A. Higher-order optimality conditions for nonregular multiobjective problem. Ann. Oper. Res. 2024, 1–21. [Google Scholar] [CrossRef]
  33. Maeda, T. Constraint qualifications in multiobjective optimization problems: Differentiable case. J. Optim. Theory Appl. 1994, 80, 483–500. [Google Scholar] [CrossRef]
  34. Bergmann, R.; Herzog, R. Intrinsic formulation of KKT conditions and constraint qualifications on smooth manifolds. SIAM J. Optim. 2019, 29, 2423–2444. [Google Scholar] [CrossRef]
  35. Rapcsák, T. Smooth Nonlinear Optimization in Rn; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  36. Upadhyay, B.B.; Ghosh, A.; Treanţă, S. Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds. J. Glob. Optim. 2024, 89, 723–744. [Google Scholar] [CrossRef]
  37. Ghosh, A.; Upadhyay, B.B.; Stancu-Minasian, I.M. Constraint qualifications for multiobjective programming problems on Hadamard manifolds. Aust. J. Math. Anal. Appl. 2023, 20, 1–17. [Google Scholar]
  38. Ghosh, A.; Upadhyay, B.B.; Stancu-Minasian, I.M. Pareto efficiency criteria and duality for multiobjective fractional programming problems with equilibrium constraints on Hadamard manifolds. Mathematics 2023, 11, 3649. [Google Scholar] [CrossRef]
  39. Karkhaneei, M.M.; Mahdavi-Amiri, N. Nonconvex weak sharp minima on Riemannian manifolds. J. Optim. Theory Appl. 2019, 183, 85–104. [Google Scholar] [CrossRef]
  40. Lim, Y.; Hiai, F.; Lawson, J. Nonhomogeneous Karcher equations with vector fields on positive definite matrices. Eur. J. Math. 2021, 7, 1291–1328. [Google Scholar] [CrossRef]
Figure 1. Interralations among the constraint qualifications for MOMPVC.
Figure 1. Interralations among the constraint qualifications for MOMPVC.
Mathematics 12 03047 g001
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.

Share and Cite

MDPI and ACS Style

Upadhyay, B.B.; Ghosh, A.; Treanţă, S.; Yao, J.-C. Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds. Mathematics 2024, 12, 3047. https://doi.org/10.3390/math12193047

AMA Style

Upadhyay BB, Ghosh A, Treanţă S, Yao J-C. Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds. Mathematics. 2024; 12(19):3047. https://doi.org/10.3390/math12193047

Chicago/Turabian Style

Upadhyay, Balendu Bhooshan, Arnav Ghosh, Savin Treanţă, and Jen-Chih Yao. 2024. "Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds" Mathematics 12, no. 19: 3047. https://doi.org/10.3390/math12193047

APA Style

Upadhyay, B. B., Ghosh, A., Treanţă, S., & Yao, J. -C. (2024). Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds. Mathematics, 12(19), 3047. https://doi.org/10.3390/math12193047

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop