Strong geodesic convex functions of order m
Akhlad Iqbal, Izhar Ahmad

TL;DR
This paper introduces the concept of strong geodesic convex functions of order m on Riemannian manifolds, providing characterizations and linking them to variational inequalities and multiobjective optimization.
Contribution
It establishes the properties of strong geodesic convex functions of order m and connects these to variational inequalities and optimization solutions.
Findings
Characterization of strong geodesic convex functions of order m
Relation between variational inequality solutions and strict minimizers
Extension of convexity concepts to Riemannian manifolds
Abstract
Strong geodesic convex function and strong monotone vector field of order on Riemannian manifolds have been established. A characterization of strong geodesic convex function of order for the continuously differentiable functions has been discussed. The relation between the solution of a new variational inequality problem and the strict minimizers of order for a multiobjective programming problem has also been established.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Strong geodesic convex functions of order m
Akhlad Iqbal∗ and Izhar Ahmad*∗∗*
∗Department of Mathematics,Aligarh Muslim University,
Aligarh-202002, India
*∗∗*Department of Mathematics and Statistics, King Fahd University of
*Petroleum and Minerals, Dhahran 31261, Saudi Arabia
emails:[email protected]; [email protected]*
Abstract. Strong geodesic convex function and strong monotone vector field of order on Riemannian manifolds have been established. A characterization of strong geodesic convex function of order for the continuously differentiable functions has been discussed. The relation between the solution of a new variational inequality problem and the strict minimizers of order for a multiobjective programming problem has also been established.
**2010 Mathematics Subject Classification: ** 33B15; 26B25; 26D15; 26D10.
Keywords: Geodesic convex function, Monotone vector field, Variational inequality problem, Riemannian manifolds.
1 Introduction
The theory of convex functions has significant applications in optimization and variational inequality problems. Many scientists and researchers have explored it broadly in finite as well as infinite dimensional linear spaces, for the details see[1-7]. Because of its vast applications many generalizations have been proposed. Rapcsak [8] and Udriste [9] presented an innovative generalization, in which the line segment is replaced by the geodesic and Euclidean space is replaced by the Riemannian manifolds.
Motivated by the fact that the model of convex function unveils all its applications and outcomes only when it is developed on Riemannian manifolds, we define strong geodesic convex function and strongly monotone vector field of order on Riemannian manifolds.
Some variational inequality problems on Euclidean spaces can not be solved using classical technique but can be solved on manifolds. Nemeth [3] introduced the concept of variational inequality problem (VIP) on Hadamard manifolds while Li et. al. [10] discussed its existence and uniqueness on Riemannian manifolds.
Motivated by the above mentioned research work, we introduce variational inequality problem and establish a relation between its solution and the strict minimizers of order for a multiobjective programming problem.
2 Preliminaries
Let be a complete -dimensional Riemannian manifold with Riemannian connection . Let be the tangent space at and denotes the scalar product on with the associated norm denoted by . A vector field on is a map from to which associates with each pint a vector . Let be a geodesic joining the points such that and . For the basic definitions and concepts of Riemannian geometry one can see ( [11], [12]).
Rapcsak [ 8] defined geodesic convexity as follows.
Definition 2.1. [8] A set is called geodesic convex if a geodesic joining any two points belongs to .
Definition 2.2. [8] A real valued function is called geodesic convex if
[TABLE]
for every and
Udriste [9] has defined totally convex set as follows.
Definition 2.3. [9] A set is called totally convex if contains every geodesic of whose end points and are in .
3 Strong geodesic convex functions of order m
Lin et al. [13 ] extended the concept of convexity to strong convexity of order on as follows.
Definition 3.1. [13] Let be a convex seubset of . A function is said to be strongly convex of order if there exists a constant such that
[TABLE]
for any and
Motivated by Lin et al. [13], we introduce the concept of strong geodesic convex function of order .
Definition 3.2. Suppose is a geodesic convex set of . A function is said to be strongly geodesic convex of order on if there exists a constant such that
[TABLE]
for every and
Remark. Let . Then the above definition becomes the definition of geodesic convex defined by Rapcsak [8].
Theorem 3.1. Suppose is a geodesic convex set and be continuously defferentiable on . Then, is strongly geodesic convex of order on if and only if there exists a constant , such that,
[TABLE]
Proof. From the definition of strongly geodesic convex, we have
[TABLE]
or
[TABLE]
Taking limit , we get
[TABLE]
or
[TABLE]
Conversely, let the given condition holds true for some . Changing with , we get
[TABLE]
where is a geodesic joining with . After fixing we get the point . Let , be the restriction for the geodesic arc that joins and .
Setting we obtainn the reparametrization
[TABLE]
where
Similarly, the restriction is a geodesic joining with . Setting , we find the reparametrization
[TABLE]
where
On replacing with in and by , we get
[TABLE]
Analogously, replacing with and by in , we get
[TABLE]
Multiplying by , by and then adding, we get
[TABLE]
[TABLE]
Which shows that is strongly geodesic convex of order .
Nemeth [14] defined monotone vector fields on Riemannian manifolds as follows.
Definition 3.3. Let be a Riemannian manifold and be a vecor field on . is called monotone on if for every
[TABLE]
where denotes the tangent vector of with respect to the arc length.
We define strong monotone vector field of order and establish a relation with strong geodesic convex function of order .
Definition 3.4. Suppose is a geodesic convex set. A vector field on is called strongly monotone of order if there exists a constant such that
[TABLE]
Theorem 3.2. Suppose is a geodesic convex set and be continuously defferentiable on . Then, is strongly geodesic convex of order on iff is strongly monotone of order on .
Proof. Let be strongly geodesic convex of order on . By Theorem 3.1, there exists a constant such that holds. Then, for any , we have
[TABLE]
[TABLE]
On adding, we get
[TABLE]
or
[TABLE]
Which shows that if part is true.
Conversely, let holds true and . Set
By the mean value theorem,
[TABLE]
[TABLE]
It follows from ,
[TABLE]
Taking limit , we get
[TABLE]
Using theorem 3.1, the result follows.
Definition 3.5. Suppose is a geodesic convex set. A vector field on is called strongly pseudomonotone of order if
[TABLE]
Proposition 3.1. Every strongly monotone vector field of order is strongly pseudomonotone of order .
Proof. Let on be strongly monotone of order , then
[TABLE]
or
[TABLE]
Let , then
[TABLE]
Hence, is strongly pseudomonotone of order .
4 Variational Inequality Problem
Let be a complete Riemannian manifold and be a non empty set of . Let denotes the collection of all geodesics from to such that . Suppose that , where be a set-valued vector field on . The variational inequality problem is to find and such that
[TABLE]
where , , .
The multiobjective optimization problem (MOP) is to find a strict minimizer of order for
[TABLE]
Theorem 4.1. Let be strongly convex of order m on . Then is the solution of VIP with , iff is a strict minimizer of order for the MOP.
Proof. Suppose is the solution of VIP but is not a strict minimizer of order for MOP. Then for , there exists some , such that
[TABLE]
or
[TABLE]
Since , are strongly geodesic convex of order on , the above inequality implies
[TABLE]
that is
[TABLE]
which contradicts the assumption that is the solution of the VIP.
Conversely, let be a strict minimizer of order for (MOP) but is not a solution of (VIP). Therefore, there exists an such that
[TABLE]
Using the definition of strongly geodesic convexity of order for we get
[TABLE]
which contradicts the strict minimizer condition. Consequently, is not a strict minimizer of order for (MOP) and hence is a solution of (VIP).
REFERENCES
Pini, R.: Convexity along curves and invexity. Optimization 29, 301-309 (1994). 2. 2.
Mititelu, S.: Generalized invexity and vector optimization on differentiable manifolds. Diff. Geom. Dyn. Syst. 3, 21-31 (2001). 3. 3.
Nemeth, S.Z.: Variational Inequalities on Hadamard Manifolds. Nonlinear Anal. 52: 1491-1498 (2003). 4. 4.
Iqbal, A., Ali, S., Ahmad, I., On geodesic E-convex sets, geodesic E-convex functions and E-epigraphs. J Optim Theory Appl 155(1): 239-251 (2012). 5. 5.
Iqbal, A., Ahmad, I., Ali, S., Some properties of geodesic semi-E-convex functions. Nonlinear Anal. 74, 6805-6813 (2011). 6. 6.
Iqbal, A.: On -preinvex functions. Comm. Appl. Anal. 20: 175-185 (2016). 7. 7.
Pouryayevali, M.R., Barani, A., Invariant monotone vector fields on Riemannian manifolds, Nonlinear Anal. 70 (5), 1850-1861 (2009). 8. 8.
Rapcsak, T.: Smooth Nonlinear Optimization in , Kluwer Academic Publishers (1997). 9. 9.
Udriste, C.: Convex Functions and Optimization Methods on Riemannian Manifolds, Kluwer Academic Publishers (1994). 10. 10.
Li, S.L., Li, C., Liou, Y.C., Yao, J.C.: Existence of solutions for variational inequalities on Riemannian manifolds. Nonlinear Anal. 71, 5695-5706 (2009). 11. 11.
do Carmo, M.P.: Riemannian Geometry, Bikhauser, Boston, 1992. 12. 12.
Spivak, M.: Calculus on Manifolds: A Modern Aproach to Classical Theorems of Advanced Calculus, W.A. Benjamin, Inc, New York, Amsterdam, 1965. 13. 13.
Lin, G.H., Fukushima, M.: Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints. J Optim Theory Appl. 118 (1), 67-80 (2003). 14. 14.
Nemeth, S.Z.: Monotone vector fields, Publ. Mat. 54, 437-449 (1999).
