1. Introduction
The pursuit of equilibrium is a ubiquitous horizon in practically all areas of human activity. For example, in economics, the dynamics of offer and demand are typically described as equilibrium problems. In the same way, physical or social phenomena such as the distribution of particles in a container, traffic flow or telecommunication networks can be accurately conceptualized in terms of equilibrium.
However, it was not until Fan [
1] that equilibrium theory was applied in the context of Euclidean spaces. Mathematically, the simplest definition of a equilibrium problem consists in finding
such that
where
is a nonempty closed set and
is an equilibrium bifunction, i.e.,
for all
.
Some of the main mathematical problems that can be phrased as equilibrium problems are:
The weak minimum point of a multiobjective function
over a closed set
is any
such that for any
such that
. Finding a weak minimum point can be reduced to solving an equilibrium problem by virtue of setting
The Stampacchia variational inequality problem demands finding
such that
where
and
is a closed set. This problem is also an equilibrium problem where
Nash equilibrium problems in a non-cooperative game with
p players where each player
i has a set of possible strategies
aim to minimize a loss function
with
. Thus, a Nash equilibrium point is any
such that no player can reduce its loss by unilaterally changing their strategy, i.e., any
such that
holds for any
for any
, with
denoting the vector obtained from
by replacing
with
. Therefore, this problem amounts to solving an equilibrium problem with
Despite their apparent diversity, all the above-mentioned problems can be framed as particular cases of the vector equilibrium problem and thus can all be encompassed in a single mathematical picture. Due to the power of this formulation, it is of great interest to obtain and study the Karush–Kuhn–Tucker (KKT) optimality conditions for the solution of such, more general problems.
Thanks to their capacity to provide such a fundamental insight, vector equilibrium problems are an active branch of non-linear analysis with plenty of publications being made up to this date. For example, in 2003, authors such as Iusem and Sosa [
2] studied the relation between equilibrium problems and some auxiliary convex problems. In addition, over the past century, the field of physics departed from euclidean geometry as a space in which to allocate its theories, opting instead for more complex spaces also known as manifolds. A historical landmark that illustrates this example is Einstein’s theory of gravity that revolves around the concept of space-time curvature on a Riemannian manifold. Other less known but equally fundamental applications in the fields of physics involve the appearance of symplectic manifolds in the treatment of Hamiltonian vector fields or Noether’s theorem.
Smooth Riemannian manifolds are spaces that contain curvature, as opposed to Euclidean spaces which are flat everywhere. This can be mathematically expressed as , where M is a Riemannian manifold. Nonetheless, Riemannian geometry constitutes a generalization of the Euclidean case. This can be easily understood by introducing the notion of tangent planes. For any point of a smooth curved space, say a 2-Sphere, it is always possible to define a flat tangent plane to that point; i.e., a Euclidean space. We can think of this in the same way we think of the Earth to be flat at local scales while overall being spherical. Indeed, all curved manifolds locally resemble Euclidean space, which is a vital property for our understanding of them. However, cartography can empirically tell us that flat projections of curved surfaces onto planes fails to faithfully represent the real dimensions of the objects that live on the original curved surface especially at large scales where the locality condition starts weakening. Thus, metricity is no longer trivial and measurements of distances need to account for such curvature.
At this point, we can already see how Euclidean spaces are simply Riemannian manifolds for which the tangent plane to any of its points is identical to the plane itself. Thus, in Euclidean spaces, vectors living of the surface are equivalent to vectors living on its tangent space. It is this key feature of Euclidean geometry that allows for the simple definition of distance as the dot product. Thus, given a vector
u, if allocated in an Euclidean space, its length is given by
. On the other hand, in non-flat spaces it is necessary to account for the distortion of the distances when projected to the tangent space. Riemannian manifolds are those equipped with a so called “metric tensor”; commonly denoted
, that allows us to adequately define distances; i.e.,
. (see
Section 2 for more details).
This new definition of length has direct short comings in minimization and equilibrium. The Euclidean line element, the shortest connection between two points on a flat surface, is replaced on manifolds by a geodesic equation which plays the role of straight lines in non-flat spaces. This can be seen from the fact that geodesic curves are solutions to the Euler–Lagrange equations which minimize the functional of the Lagrangian given by the metric of such space, , and as such describe the trajectories that minimize the action necessary to move from A to B. For example, the orbits of planets obey geodesics despite clearly not being straight in a Euclidean sense.
A Hadamard manifold is a simply connected complete Riemannian manifold of non-positive sectional curvature. The motivation of the study of Hadamard spaces is that they share some properties with Euclidean spaces. One of them is the separation theorem (see Ferreira and Oliveira [
3]).
In addition, for any two points in
M, there exists a minimal geodesic joining these two points. In a Hadamard manifold, the geodesic between any two points is unique and the exponential map at each point of
M is a global diffeomorphism. Moreover, the
map is defined on the whole tangent space ([
4]).
However, the minimization of functions on a Hadamard manifold is locally equivalent to the smoothly constrained optimization problem on a Euclidean space, due to the fact that every Hadamard manifold can be isometrically embedded in an Euclidean space by virtue of John Nash’s embedding theorem. This is consistent with the intuition we previously laid out.
The study of optimization problems on Hadamard manifolds is a powerful tool. This is due to the fact that, generally, solving nonconvex constrained problems in
with the Euclidean metric can be also framed as solving the unconstrained convex minimization problem in the Hadamard manifold feasible set with the affine metric (see [
5]). In Colao et al. [
5] the existence of solutions for equilibrium problems under some suitable conditions on Hadamard manifolds and their applications to Nash equilibrium for non-cooperative games was studied. In the same way, in Németh [
6] the existence and uniqueness results for variational inequality problems on Hadamard manifolds were obtained.
Moreover, many optimization problems cannot be solved in linear spaces, for example, controlled thermonuclear fusion research (see [
7]), signal processing, numerical analysis and computer vision (see [
8,
9]) require Hadamard manifold structures for their modeling. Also, geometrical structures hidden in data sets of machine learning problems are studied in terms of manifolds. In the field of medicine, Hadamard manifolds have been used in the analysis of magnetic resonances to quantify the growth of tumors and consequently deduce their state of progression, as shown by Fletcher et al. [
10]. The geometry necessary to understand and perform these techniques is best understood through the use of manifolds and symmetric structures. For example, the set of symmetric positive definite matrices used in magnetic resonance imaging to study Alzheimer’s disease [
11] is one case in which this translation to manifolds is necessary. In addition, other problems in computer vision, signal processing or learning algorithms employ geodesic curves when addressing optimization problems. Finally, in economics, the search of Nash–Stampacchia equilibria points using Hadamard manifolds has been used by Kristály [
12].
It is known that a convex environment has good properties for the search of optimal points. In Ferreira [
13], the author gives necessary and sufficient conditions for convex functions on Hadamard manifolds. A significant generalization of the convex functions are the invex functions, introduced by Hanson [
14], where the
x-
y vector is replaced by any function
. The main result of invex functions states that a scalar function is invex if and only if every critical point is a global minimum solution. This property is essential to obtain optimal points through algorithms, due to the coincidence of critical points and solutions being always assured. In Barani and Pouryayeli [
15] and Hosseini and Pouryayevali [
16], the relation between invexity and monotonicity using the mean value theorem is studied. Ruiz-Garzón et al. [
17] showed that invexity can be characterized in the context of Riemannian manifolds for both scalar and vector cases, in a similar way to Euclidean spaces. Recently, in Ahmad et al. [
18] the authors introduced the log-preinvex and log-invex functions on Riemannian manifolds and the mean value theorem on Cartan-Hadamard manifolds.
In the same way, several authors have studied vector equilibrium problems. Ansari and Flores-Bazán [
19] were capable of providing a theorem of existence of solutions to vector quasi-equilibrium problems. Furthermore, a characterization for a weakly efficient Pareto point for the vector equilibrium problems with constraints under convexity conditions on real Hausdorff topological vector spaces were presented by Gong [
20]. In the following years, scalarization results for the solutions to the vector equilibrium problems were also given by Gong [
21]. Later, optimality conditions for weakly efficient Pareto points to vector equilibrium problems with constraints in real normed spaces were investigated by Wei and Gong [
22]. Also, sufficient conditions of weakly efficient Pareto points on real Banach spaces for vector equilibrium and vector optimization problems with constraints under generalized invexity were obtained by Feng and Qiu [
23].
Motivated by Gong’s works mentioned above, our objective will focus on extending the KKT necessary and sufficient conditions for constrained vector equilibrium problems obtained in topological or normed spaces to other environments like the Hadamard manifolds, not present in the literature up to date of publication. Hence, we propose a generalization that extends the linear space definition to Hadamard manifolds, by virtue of substituting line segments by geodesic arcs. We will see that the KKT classic conditions for constrained vector optimization are a particular case of the ones obtained for constrained vector equilibrium problem.
The organization of the paper is as follows: In
Section 2, we discuss notation, differentials and invex function concepts on Hadamard manifolds.
Section 3 is devoted to proving the main results obtained in this paper, and studying the necessary and sufficient optimality conditions for weakly efficient points of the constrained vector equilibrium problem.
Section 4 dwells on how the previous results can be reduced to classical KKT conditions for constrained vector optimization problems, first obtained by William Karush [
24] and rediscovered by Harold Kuhn and Albert Tucker [
25]. Finally, an example is presented as well as the final conclusions.
2. Preliminaries
Let
M be a
-manifold modeled on a Hilbert space
H endowed with a Riemannian metric
on a tangent space
. We denote by
the tangent space of
M at
x, by
the tangent bundle of
M, by
an open neighborhood of the submanifold
M of
. The corresponding norm is denoted by
and the length of a piecewise
curve
is defined by
We define
d as the distance which induces the original topology on
M such that
If
d is the distance induced by the Riemannian metric
then any Riemannian manifold
can be converted into a metric space
. The derivatives of the curves at a point
x on the manifold lies in a vector space
. Whatever path
joining
x and
y in
M such that
is a geodesic.
Let be the Riemannian exponential map defined as for every , where is the geodesic starting at x with velocity V (i.e., ).
Assume now that
is a map
defined on the product manifold such that
Definition 1. [26] A subset of M is considered totally convex if contains every geodesic of M whose endpoints x and y belong to . On a Hadamard manifold
M, we can define the function
as
for all
. This function plays the same role of
. Here
is the unique minimal geodesic joining
y to
x as follows
Example 1. Let endowed with the Riemannian metric defined by be a Hadamard manifold. Hyperbolic spaces and geodesic spaces, more precisely, a Busemann non-positive curvature (NPC) space are examples of Hadarmard manifolds.
We will need an adequate concept of the differential:
Definition 2. [27] A mapping is said to be a differential map along the geodesic at if and only if the limitexists. The gradient of a real-valued function on M in x, denoted by , is the unique vector in such that for all X in is the differential of f at of X.
Remark 1. The differential of f at of X is similar to the definition of directional derivative in the Euclidean space.
Let be a nonempty open totally convex subset and let , be mappings.
Definition 3. We define the constraint set and consider the vector equilibrium problem with constraints (VEPC): find such thatwhere is the non-negative orthant of . We recall the classical concept:
Definition 4. A vector satisfying is called a weakly efficient Pareto point to the VEPC.
Notation 1. We denote as given , where is a mapping.
Inspired by the concept of convexity on a linear space, the notion of invexity function concept on Hadamard manifolds has become a successful tool in vector optimization. This generalized definition was notably provided by Hanson in [
14].
Definition 5. Let be a nonempty open totally convex subset of a Hadamard manifold M. A differentiable function is said to be a -invex at respect to if there exist such that Using the previously stated definitions, we can obtain the sufficient conditions for optimality by virtue of the assumption of invexity of the functions of the problem.