Skip to Content
MathematicsMathematics
  • Article
  • Open Access

11 March 2026

14 Pages

Approximate Convexity of Set-Valued Mappings and Variational Inequalities

Department of Mathematics, College of Science, Qassim University, Burydah 52571, Saudi Arabia

Abstract

In this article, we introduce the notion of approximate convexity for set-valued mappings, specifically in the forms of approximate pseudoconvexity and approximate quasiconvexity. These generalizations are motivated by the need to handle optimization problems involving multi-valued operators and vector-valued objective functions, where classical convexity assumptions are too restrictive. We demonstrate that the proposed framework preserves the essential structural features of convex analysis while broadening its applicability. After that, we investigate the introduced definitions through illustrative examples. Furthermore, we consider a set-valued optimization problem and rigorously investigate the relationships among its efficient solutions and the solutions of generalized Minty and Stampacchia variational inequality problems. The results provide a coherent theoretical bridge between optimality conditions and variational inequality formulations for set-valued mappings.

1. Introduction

Convexity is a cornerstone of optimization theory, as it ensures any local minimum of a convex function is also a global minimum. This property is essential for both theoretical analysis and practical optimization methods. To broaden the scope of convex analysis, Jofre et al. [1] introduced ε -convexity, a more flexible extension of classic convexity in 1998. Building on this, Ngai et al. [2] proposed approximate convexity, which keeps crucial structural features of convex functions while allowing for a wider range of optimization problems in 2000. These extensions address cases where strict convexity is absent, yet essential mathematical properties remain in a generalized form. In 2018, Gupta and Mishra [3] analyzed the relationship between approximate and generalized convexity, linking variational inequalities and nonsmooth optimization problems in vector spaces via generalized approximate convexity. Building on Mishra and Laha’s [4] foundational systematic analysis of vector optimization with locally Lipschitz and approximately convex objective functions, later research refined this mathematical framework in 2016, then their work formulated notions of approximate efficiency and developed Stampacchia-type and Minty-type approximate vector variational inequalities, expanding analytical tools for characterizing efficient solutions. In 2004, Advancements by Georgiev [5] showed that, for locally Lipschitz functions, approximate convexity is equivalent to submonotonicity of the Clarke subdifferential, establishing a structural link between approximate and generalized convexity in nonsmooth analysis. In 1988, Further generalizations by Bhatia et al. [6] broadened the field, while Malmir and Barani [7] showed equivalence between locally Lipschitz approximately convex functions and lower- C 1 functions, and a correspondence between strict approximate convexity and strict submonotonicity of the Clarke subdifferential in 2022.
Despite these important developments, several theoretical challenges remain unresolved. Foremost among these is the extension of subdifferential characterizations to functions that lack local Lipschitz continuity, thereby expanding the applicability of established frameworks to a broader class of nonsmooth functions. Moreover, the precise relationships between approximate convexity and other generalized convexity notions—including invexity, quasiconvexity, and star-shapedness—remain insufficiently elucidated. This gap hinders the integration and comparative analysis of various generalized convexity frameworks. The absence of generalized, robust methodologies for handling non-Lipschitzian, higher-order nonsmoothness further impedes progress in these directions. Therefore, although recent literature has substantively advanced both the theoretical and methodological foundations of approximate convexity and its subdifferential properties, critical gaps persist. For more information, see [8,9,10].
In addition, in 2018, Olbrys [11] developed the concept of ( ω , t ) -convexity, presenting it as a generalization of classical t-convexity and its variants, such as t-strong convexity, approximate t-convexity, and d t -convexity. The main contribution of this work is in identifying precise conditions for when a ( ω , t ) -convex function has local support by a corresponding ( ω , t ) -affine support function at a given point. This advance broadens the functions to which convex analytic techniques apply and helps identify new criteria for characterizing inner product spaces within normed linear spaces. Recently, significant work has extended core ideas from convex scalar functions to set-valued mappings; see [12,13,14,15,16].
This shift addresses new complexities in set-valued optimization, such as solution sets and multi-valuedness. In 2022, Durea and Strugariu [17] created a framework for directional derivatives and subdifferentials that mirrors real-valued function constructs, bridging the scalar and set-valued cases. In 2017, Oveisiha and Aghabagloo [18] used scalarization to characterize relaxed K-preinvexity for set-valued mappings and tied solution sets from generalized Minty variational-like inequalities in set-valued relaxed convexity, directly linking them to those of scalarized set-valued optimization. This work clarifies the connection between scalar and set-valued frameworks, enabling the transfer of analytic tools. In 2013, Oveisiha and Zafarani [19] advanced set-valued optimization by giving normal subdifferential-based characterizations for K-preinvex set-valued mappings. They established super-minimal points, found necessary conditions for super-efficiency, and described Clarke–Rockafellar and limiting subdifferential properties for β -weakly preinvex and pseudoinvex functions. Using pseudoinvexity, they proved equivalence between vector variational-like inequalities and corresponding vector optimization problems. For more information see [20,21].
Although approximate convexity for real-valued functions and generalized convexity for set-valued mappings have each received considerable attention, the systematic extension of approximate convexity notions—specifically approximate pseudoconvexity and quasiconvexity—to the set-valued framework has not been addressed in the existing literature. In particular:
  • The existing works on set-valued optimization (e.g., [18,19]) focus on preinvex or K-convex set-valued maps but do not develop approximate variants.
  • The approximate convexity results of [3,4,5] are restricted to real-valued or vector-valued functions and do not accommodate the multi-valued nature of set-valued operators.
  • The relationships between optimality conditions and variational inequalities have not been established under approximate convexity assumptions for set-valued mappings.
The present paper bridges this gap by:
1.
Introducing approximate K -convexity, approximate pseudoconvexity (types I and II), and approximate quasiconvexity (types I and II) for set-valued mappings in Banach spaces.
2.
Establishing the relationships among scalarized locally quasi-efficient solutions (SLQE), locally weak quasi-efficient solutions (LWQE), generalized Minty variational inequality problems P ( G M V I P ) , and generalized Stampacchia variational inequality problems P ( G S V I P ) .
3.
Demonstrating the practical implications of the proposed framework through worked examples.
4.
Discussing potential extensions and open problems to guide future research.
This paper rigorously defines approximate convexity for set-valued mappings, extending classical convexity theory. Using the Mordukhovich normal subdifferential, it establishes that, under specific conditions, a set-valued mapping’s approximate convexity is equivalent to the approximate monotonicity of its subdifferential. This equivalence creates a unified paradigm for variational and nonsmooth analysis. While providing a foundation for set-valued optimization, challenges remain, such as extending the results to non-Lipschitz functions and relating approximate convexity to other generalized convexity concepts.

2. Preliminaries

In this section, consider two Banach spaces X and Y . Let X ∗ represent the continuous dual of X . The symbol ∥ · ∥ will denote the norm on X as well as on X ∗ . Moreover, write B X for the closed unit ball of X , and let K be a closed convex cone contained in Y .
Definition 1 
([22]). Let X be a Banach space and Ω ⊆ X a nonempty set. For a point u ∈ Ω and a number ε ≥ 0 , the ε-normal set of Ω at u is defined as
N ^ ε ( u ; Ω ) : = u ∗ ∈ X ∗ | lim sup w → u ⟨ u ∗ , w − u ⟩ ∥ w − u ∥ ≤ ε .
When ε = 0 , we write N ^ ( u ; Ω ) and refer to it as the regular normal cone to Ω at u. For a point u ¯ ∈ Ω , the basic normal cone to Ω at u ¯ is given by
N ( u ¯ ; Ω ) : = lim sup u → u ¯ ε ↓ 0 N ^ ε ( u ; Ω ) .
Definition 2 
([7]). A real-valued function f : Ω ⊂ X → R is called approximately convex at u 0 ∈ Ω if for every β > 0 there exists δ > 0 such that for all u 1 , u 2 ∈ B ( u 0 , δ ) ∩ Ω and every t ∈ [ 0 , 1 ] ,
f t u 1 + ( 1 − t ) u 2 ≤ t f ( u 1 ) + ( 1 − t ) f ( u 2 ) + β t ( 1 − t ) ∥ u 1 − u 2 ∥ .
Definition 3 
([22]). Let F : X ⇉ Y be a set-valued operator between Banach spaces, and let ( u ¯ , v ¯ ) ∈ gr F . The normal (Fréchet) coderivative of F at ( u ¯ , v ¯ ) is the set-valued mapping D N ∗ F ( u ¯ , v ¯ ) : Y ∗ ⇉ X ∗ ( D ∗ ^ F ( u ¯ , v ¯ ) : Y ∗ ⇉ X ∗ ) given by
D N ∗ F ( u ¯ , v ¯ ) ( v ∗ ) : = { u ∗ ∈ X ∗ | ( u ∗ , − v ∗ ) ∈ N ( ( u ¯ , v ¯ ) ; g r F ) } .
( D ∗ ^ F ( u ¯ , v ¯ ) ( v ∗ ) : = { u ∗ ∈ X ∗ | ( u ∗ , − v ∗ ) ∈ N ^ ( ( u ¯ , v ¯ ) ; g r F ) } . )
Definition 4 
([23]). Let F : X ⇉ Y be a set-valued mapping. Then the Normal (Frechet) subdifferential of F at the point ( u ¯ , v ¯ ) ∈ e p i F in the direction v ∗ ∈ Y ∗ is defined by ∂ F ( u ¯ , v ¯ ) ( v ∗ ) : = D N ∗ E F ( u ¯ , v ¯ ) ( v ∗ ) ( ∂ ^ F ( u ¯ , v ¯ ) ( v ∗ ) : = D ∗ E F ( u ¯ , v ¯ ) ( v ∗ ) ).
We now introduce a generalization of approximate convexity to set-valued mappings.
Definition 5. 
Let Ω ⊂ X be a convex set and F : Ω ⇉ Y a set-valued mapping. Then F is said to be approximately K -convex at a point u 0 ∈ dom F if for every β > 0 there exists δ > 0 (depending on u 0 and β) such that for all u 1 , u 2 ∈ B ( u 0 , δ ) ∩ Ω and every t ∈ [ 0 , 1 ] ,
t F ( u 1 ) + ( 1 − t ) F ( u 2 ) + β t ( 1 − t ) ∥ u 1 − u 2 ∥ e ⊆ F t u 1 + ( 1 − t ) u 2 + K ,
is satisfied for each unit vector e ∈ int K (i.e., e ∈ int K with ∥ e ∥ = 1 ).
Remark 1. 
Let Ω ⊂ X be a convex set and F : Ω ⊂ X ⇉ Y .
  • F is said to satisfy condition ( AC ) 1 at u 0 ∈ d o m F if for every β > 0 there exists δ > 0 such that for any u i ∈ B ( u 0 , δ ) , v ∗ ∈ K + ∩ S Y ∗ and v i ∈ F ( u i ) , ( i = 1 , 2 ) , one has
    < ξ , u 2 − u 1 > − β ∥ u 2 − u 1 ∥ ≤ v ∗ ( v 2 ) − v ∗ ( v 1 ) ,
    for some ξ ∈ ∂ F ( u 1 , v 1 ) ( v ∗ ) .
  • F is said to satisfy Condition ( AC ) 2 at u 0 ∈ d o m F if for every β > 0 there exists δ > 0 such that for any u i ∈ B ( u 0 , δ ) , v ∗ ∈ K + ∩ S Y ∗ , v i ∈ F ( u i ) , ( i = 1 , 2 ) , and ξ ∈ ∂ F ( u 1 , v 1 ) ( v ∗ ) one has
    < ξ , u 2 − u 1 > − β ∥ u 2 − u 1 ∥ ≤ v ∗ ( v 2 ) − v ∗ ( v 1 ) .
We note that condition ( AC ) 2 is strictly stronger than ( AC ) 1 , since ( AC ) 2 requires the inequality to hold for all ξ ∈ ∂ F ( u 1 , v 1 ) ( v ∗ ) , whereas ( AC ) 1 only requires it for some such ξ . This distinction is crucial in the proof of Theorem 3, where the universal quantifier in ( AC ) 2 ensures that the subdifferential inequality holds regardless of the selection made.
Example 1. 
Suppose that X = Y = R , K = [ 0 , + ∞ ) . Let F : X ⇉ Y such that
F ( u ) = u 2 + u , + ∞ , u ≥ 0 u 2 , + ∞ , u < 0
Then, we have
∂ F ( u , u 2 + u ) ( 1 ) = { 2 u + 1 } , u > 0 ∂ F ( 0 , 0 ) ( 1 ) = [ 0 , 1 ] , u = 0 ∂ F ( u , u 2 ) ( 1 ) = { 2 u } , u < 0 .
Clearly F satisfies condition ( AC ) 2 ; hence it also satisfies ( AC ) 1 .
Verification of ( AC ) 2 : Fix β > 0 and let δ > 0 be arbitrary. Take u 1 , u 2 ∈ B ( 0 , δ ) , v ∗ = 1 ∈ K + ∩ S R ∗ . For any ξ ∈ ∂ F ( u 1 , v 1 ) ( 1 ) and corresponding v i ∈ F ( u i ) , one can verify case-by-case that ξ ( u 2 − u 1 ) − β ∥ u 2 − u 1 ∥ ≤ v ∗ ( v 2 ) − v ∗ ( v 1 ) by using the piecewise structure of F and the explicit computation of the subdifferential above. This confirms ( AC ) 2 , and ( AC ) 1 follows immediately since it is a weaker condition.
Example 2 
(Higher-dimensional illustration of ( AC ) 1 and ( AC ) 2 ). Let X = R 2 , Y = R 2 , and K = R + 2 = { ( y 1 , y 2 ) ∈ R 2 : y 1 ≥ 0 , y 2 ≥ 0 } . Define the set-valued map F : R 2 ⇉ R 2 by
F ( u 1 , u 2 ) = ϕ 1 ( u 1 , u 2 ) , + ∞ × ϕ 2 ( u 1 , u 2 ) , + ∞ ,
where
ϕ 1 ( u 1 , u 2 ) = u 1 2 + u 1 u 2 , ϕ 2 ( u 1 , u 2 ) = u 2 2 + u 1 u 2 .
The dual cone is K + = R + 2 . For v ∗ = ( v 1 ∗ , v 2 ∗ ) ∈ K + ∩ S R 2 ∗ (i.e., v 1 ∗ , v 2 ∗ ≥ 0 , v 1 ∗ 2 + v 2 ∗ 2 = 1 ), the scalarized function is
v ∗ ∘ F ( u 1 , u 2 ) = v 1 ∗ ϕ 1 ( u 1 , u 2 ) + v 2 ∗ ϕ 2 ( u 1 , u 2 ) = ( v 1 ∗ + v 2 ∗ ) ( u 1 u 2 ) + v 1 ∗ u 1 2 + v 2 ∗ u 2 2 .
The subdifferential (gradient) of the scalarized function at ( u ¯ 1 , u ¯ 2 ) with respect to the first argument is
∂ F ( ( u ¯ 1 , u ¯ 2 ) , v ) ( v ∗ ) = 2 v 1 ∗ u ¯ 1 + ( v 1 ∗ + v 2 ∗ ) u ¯ 2 , 2 v 2 ∗ u ¯ 2 + ( v 1 ∗ + v 2 ∗ ) u ¯ 1 .
Fix u 0 = ( 0 , 0 ) and β > 0 . For any u i = ( u i 1 , u i 2 ) ∈ B ( u 0 , δ ) ∩ Ω and any ξ ∈ ∂ F ( u 1 , v 1 ) ( v ∗ ) , a direct computation using the Cauchy–Schwarz inequality gives
⟨ ξ , u 2 − u 1 ⟩ − β ∥ u 2 − u 1 ∥ ≤ ∥ ξ ∥ · ∥ u 2 − u 1 ∥ − β ∥ u 2 − u 1 ∥ ≤ C δ − β ∥ u 2 − u 1 ∥ ,
where C > 0 depends only on the Lipschitz constant of ξ near u 0 . Choosing δ < β / C ensures this is ≤ v ∗ ( v 2 ) − v ∗ ( v 1 ) , confirming that F satisfies condition ( AC ) 2 at u 0 = ( 0 , 0 ) , and hence also ( AC ) 1 . This two-dimensional example illustrates that both conditions are not restricted to the scalar setting and extend naturally to product cone structures in R n .
Definition 6. 
Let Ω ⊂ X be a convex set. A set-valued map F : Ω ⊆ X ⇉ Y is said to be
  • Approximate pseudoconvex of type I around u 0 ∈ d o m F : This notion generalizes the classical pseudoconvexity condition ⟨ ∇ f ( u 2 ) , u 1 − u 2 ⟩ ≥ 0 ⇒ f ( u 1 ) ≥ f ( u 2 ) to the set-valued, approximate setting. Type I uses an existential quantifier over subdifferential selections, making it applicable in situations where only partial subdifferential information is available. Formally, F is approximate pseudoconvex of type I around u 0 ∈ d o m F , if for all β > 0 , there exists δ > 0 such that for all u i ∈ B ( u 0 , δ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ and v i ∈ M v ∗ ( u i ) , ( i = 1 , 2 ) , if
    < ξ , u 1 − u 2 > ≥ 0 , for some ξ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) ,
    then
    v ∗ ( v 1 ) − v ∗ ( v 2 ) ≥ − β ∥ u 1 − u 2 ∥ .
  • Approximate pseudoconvex of type II around u 0 ∈ d o m F : This variant strengthens the antecedent by adding the tolerance term β ∥ u 1 − u 2 ∥ , leading to a sharper implication. Type II is the appropriate condition for establishing that solutions of P ( G S V I P ) are (SLQE) points, as used in Theorem 2. Formally, F is approximate pseudoconvex of type II around u 0 ∈ d o m F , if for all β > 0 , there exists δ > 0 such that for all u i ∈ B ( u 0 , δ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ and v i ∈ M v ∗ ( u i ) , ( i = 1 , 2 ) , if
    < ξ , u 1 − u 2 > + β ∥ u 1 − u 2 ∥ ≥ 0 , for some ξ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) ,
    then
    v ∗ ( v 1 ) ≥ v ∗ ( v 2 ) .
Example 3. 
Suppose that X = Y = R , K = [ 0 , + ∞ ) and F : X ⇉ Y such that
F ( u ) = u 3 + u , + ∞ , u ≥ 0 2 u , + ∞ , u < 0 .
The limiting subdifferential of F is as follows:
∂ F ( u , u 3 + u ) ( 1 ) = { 3 u 2 + 1 } , u > 0 ∂ F ( 0 , 0 ) ( 1 ) = { 1 , 2 } , u = 0 ∂ F ( u , 2 u ) ( 1 ) = { 2 } , u < 0 .
F is approximate pseudoconvex of type II around u 0 = 0 ∈ d o m F , since for all β > 0 , there exists δ > 0 such that for all v ∗ ∈ K + ∩ S Y ∗ , u i ∈ B ( u 0 , δ ) ∩ Ω , v i ∈ M v ∗ ( u i ) , ( i = 1 , 2 ) , if for some ξ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) one has,
< ξ , u 1 − u 2 > + β ∥ u 1 − u 2 ∥ = ( 3 u 2 + 1 ) ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ > 0 , u 1 > 0 , u 2 > 0 , u 1 − u 2 > 0 ( 3 u 2 + 1 ) ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ < 0 , u 1 > 0 , u 2 > 0 , u 1 − u 2 < 0 ( 3 u 2 + 1 ) ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ > 0 , u 1 > 0 , u 2 ≤ 0 , u 1 − u 2 > 0 2 ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ > 0 , u 1 < 0 , u 2 < 0 , u 1 − u 2 > 0 2 ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ < 0 , u 1 < 0 , u 2 ≥ 0 2 ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ < 0 , u 1 < 0 , u 2 < 0 , u 1 − u 2 < 0 ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ < 0 , u 1 = 0 , u 2 > 0 ( u 1 − u 2 ) + β ∥ u 1 − u 2 ∥ > 0 , u 1 = 0 , u 2 < 0
then
( u 1 − u 2 ) ( u 1 2 + u 2 2 + u 1 u 2 + 1 ) > 0 , u 1 > 0 , u 2 > 0 , u 1 − u 2 > 0 u 1 3 + u 1 − 2 u 2 > 0 , u 1 > 0 , u 2 < 0 2 ( u 1 − u 2 ) > 0 , u 1 < 0 , u 2 < 0 , u 1 − u 2 > 0 u 1 3 + u 1 > 0 , u 1 = 0 , u 2 > 0
So,
v ∗ ( v 2 ) − v ∗ ( v 1 ) ≥ 0 ,
and as a result we have
v ∗ ( v 1 ) ≤ v ∗ ( v 2 ) .
Remark on the distinction between Type I and Type II: In the above example, we can also verify that F fails to be approximately pseudoconvex of type I around u 0 = 0 . Specifically, taking u 1 = − ε , u 2 = 0 for small ε > 0 , one can find ξ = 2 ∈ ∂ F ( 0 , 0 ) ( 1 ) such that ⟨ ξ , u 1 − u 2 ⟩ = − 2 ε < 0 , so the hypothesis of type I is not activated, but the slightly modified condition in type II (with the tolerance β ∥ u 1 − u 2 ∥ ) correctly captures the geometric behavior of F near u 0 = 0 . This illustrates the practical necessity of introducing both types.
Example 4 
(Higher-dimensional approximate pseudoconvexity of type II). Let X = R 2 , Y = R 2 , and K = R + 2 . Define F : R 2 ⇉ R 2 by
F ( u ) = ∥ u ∥ 3 + ∥ u ∥ , + ∞ × 2 ∥ u ∥ , + ∞ , u = ( u 1 , u 2 ) ∈ R 2 ,
where ∥ u ∥ = u 1 2 + u 2 2 . For v ∗ = ( v 1 ∗ , v 2 ∗ ) ∈ K + ∩ S R 2 ∗ , the scalarized minimum value function is
φ ( u ) : = v 1 ∗ ∥ u ∥ 3 + ∥ u ∥ + 2 v 2 ∗ ∥ u ∥ .
At u ¯ = 0 , the subdifferential of the scalarized function satisfies ∂ φ ( 0 ) = { 0 } , since φ attains its global minimum at the origin. For u 1 , u 2 ∈ B ( 0 , δ ) with δ < 1 , and for ξ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) , a direct computation gives
⟨ ξ , u 1 − u 2 ⟩ + β ∥ u 1 − u 2 ∥ ≥ 0
whenever ∥ u 1 ∥ > ∥ u 2 ∥ , using the fact that the gradient of ∥ · ∥ 3 + ∥ · ∥ points radially outward. By the rotational symmetry of F , the analysis reduces to the one-dimensional case along any radial direction, and the conclusion v ∗ ( v 1 ) ≥ v ∗ ( v 2 ) follows exactly as in Example 2. This confirms approximate pseudoconvexity of type II at u ¯ = 0 in the two-dimensional setting, showing the concept is not an artifact of the real line.
Definition 7. 
Let Ω ⊂ X be a convex set. A set-valued map F : Ω ⊆ X ⇉ Y is said to be
  • approximate quasiconvex of type I around u ¯ ∈ d o m F : This extends the classical notion f ( u 1 ) ≤ f ( u 2 ) ⇒ ⟨ ∇ f ( u 2 ) , u 1 − u 2 ⟩ ≤ 0 to the set-valued approximate context, using an existential quantifier over subdifferential elements. Formally, if for all β > 0 , there exists δ > 0 such that for all u i ∈ B ( u ¯ , δ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ and v i ∈ M v ∗ ( u i ) , ( i = 1 , 2 ) , if
    v ∗ ( v 1 ) ≤ v ∗ ( v 2 ) ,
    then
    < ξ , u 1 − u 2 > − β ∥ u 1 − u 2 ∥ ≤ 0 , ∀ ξ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) .
  • approximate quasiconvex of type II around u ¯ ∈ d o m F : This variant weakens the hypothesis by adding a tolerance term, making it better suited for proving that (SLQE) solutions satisfy P ( G S V I P ) , as shown in Theorem 2. Formally, if for all β > 0 there exists δ > 0 such that for all u i ∈ B ( u ¯ , δ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ and v i ∈ M v ∗ ( u i ) , ( i = 1 , 2 ) , if
    v ∗ ( v 1 ) ≤ v ∗ ( v 2 ) + β ∥ u 1 − u 2 ∥ ,
    then
    < ξ , u 1 − u 2 > ≤ 0 , ∀ ξ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) .
Definition 8. 
A set-valued mapping F : Ω ⊆ X ⇉ Y is said to be approximately β-pseudomonotone around u ¯ ∈ d o m F , if there exists δ > 0 such that for each u i ∈ B ( u ¯ , δ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ , v i ∈ M v ∗ ( u i ) , ( i = 1 , 2 ) , ξ ∈ ∂ F ( u 1 , v 1 ) ( v ∗ ) and ζ ∈ ∂ F ( u 2 , v 2 ) ( v ∗ ) if
< ζ , u 1 − u 2 > + β ∥ u 1 − u 2 ∥ ≥ 0 ,
then
< ξ , u 1 − u 2 > ≥ 0 .
We now turn our attention to the optimization problem
min u ∈ dom F F ( u ) ,
where F : Ω ⊆ X ⇉ Y is a set-valued map.
Two notions of efficient solutions for (1) are introduced below.
Definition 9 
(Scalarized Locally Quasi-Efficient Solution—SLQE). A point ( u ¯ , v ¯ ) ∈ gr F is an (SLQE) of (1) if there exist β > 0 and δ > 0 such that
v ∗ ( v ¯ ) ≤ v ∗ ( v ) + β ∥ u − u ¯ ∥ .
holds for all v ∗ ∈ K + ∖ { 0 } , all u ∈ B ( u ¯ , δ ) ∩ Ω , and all v ∈ F ( u ) .

3. Main Results

In this section, we investigate relations among (SLQE), P ( G M V I P ) and P ( G S V I P ) .
Remark on constants β and δ : A natural question concerning the definitions and theorems in this section is whether the constants β and δ appearing in different conditions are uniformly transferable, or whether separate constructions are required in each result. In general, the constants are not directly transferable: each theorem involves potentially distinct δ -neighborhoods, and the common approach is to take δ ¯ = min { δ , δ ′ } to find a neighborhood where all required conditions hold simultaneously. Specifically, in Theorem 3, the constant 2 β appears in the conclusion for P ( GMVIP ) as a direct consequence of combining two inequalities, each holding with constant β . In Theorems 1 and 2, the same β is transferred from one condition to another via the intersection of neighborhoods. This clarification is important for the practical application of these results.
Now, we consider the following generalized Minty and Stampacchia inequality problems.
  • P ( G M V I P ) : Generalized Minty variational inequality problem consists of finding a vector u ¯ , such that for any β > 0 there exists δ > 0 such that for any u ∈ B ( u ¯ , δ ) ∩ Ω and v ∗ ∈ K + ∩ S Y ∗ , there exist v ∈ M v ∗ ( u ) and ξ ∈ ∂ F ( u , v ) ( v ∗ ) that
    < ξ , u ¯ − u > ≤ β ∥ u − u ¯ ∥ .
    P ( G S V I P ) : The generalized Stampacchia variational inequality problem requires finding a point u ¯ ∈ Ω for which there exist constants β > 0 and δ > 0 with the following property: for every u ∈ B ( u ¯ , δ ) ∩ Ω and every v ∗ ∈ K + of unit norm (i.e., v ∗ ∈ K + ∩ S Y ∗ ), one can select v ¯ ∈ M v ∗ ( u ¯ ) and ξ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) such that
    < ξ , u − u ¯ > ≥ − β ∥ u − u ¯ ∥ .
Example 5. 
Let X = Y = R , K = [ 0 , + ∞ ) and F : X ⇉ Y be a set-valued map such that
F ( u ) = u 3 + u , + ∞ , u ≥ 0 − u , + ∞ , u < 0 .
The limiting subdifferential of F is as follows
∂ F ( u , u 3 + u ) ( 1 ) = { 3 u 2 + 1 } , u > 0 ∂ F ( 0 , 0 ) ( 1 ) = [ − 1 , 1 ] , u = 0 ∂ F ( u , − u ) ( 1 ) = { − 1 } , u < 0
u ¯ = 0 is a solution of the variational inequality P ( G S V I P ) since for all β > 0 there exists δ > 0 such that for all u ∈ B ( u ¯ , δ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ , v ¯ ∈ M v ∗ ( u ¯ ) and ξ ∈ ∂ F ( 0 , 0 ) ( 1 ) such that
< ξ , u − u ¯ > + β ∥ u − u ¯ ∥ = ( 3 u 2 + 1 ) ( u − u ¯ ) + β ∥ u − u ¯ ∥ > 0 , u > 0 k ( u − u ¯ ) + β ∥ u − u ¯ ∥ = 0 , u = 0 , k ∈ [ − 1 , 1 ] − ( u − u ¯ ) + β ∥ u − u ¯ ∥ > 0 , u < 0
that means
< ξ , u − u ¯ > + β ∥ u − u ¯ ∥ ≥ 0 ,
and as a result we have
< ξ , u − u ¯ > ≥ − β ∥ u − u ¯ ∥ .
Connection to (SLQE): By Theorem 2, since F is approximately pseudoconvex of type II around u ¯ = 0 (which can be verified analogously to Example 2), it follows that u ¯ = 0 is also an (SLQE) solution of the associated optimization problem. This confirms the logical chain P ( G S V I P ) ⇒ (SLQE) under the approximate pseudoconvexity of type II assumption.
In the next theorem, we investigate the relation between (SLQE) and P ( G M V I P ) .
Theorem 1. 
Assume condition ( AC ) 2 holds for the set-valued map F : Ω ⊆ X ⇉ Y . If u ¯ is a (SLQE) of the associated optimization problem, then u ¯ also solves the generalized Minty variational inequality problem P ( G M V I P ) .
Proof. 
Let u ¯ be an SLQE solution with constant β > 0 . Then there exists δ > 0 such that for every v ∗ ∈ K + ∖ { 0 } , every u ∈ B ( u ¯ , δ ) ∩ Ω , and every v ∈ F ( u ) ,
v ∗ ( v ¯ ) ≤ v ∗ ( v ) + β ∥ u − u ¯ ∥ .
We note that ( AC ) 2 is being applied here with the same β from the (SLQE) definition; if necessary, we take δ smaller so that both conditions hold simultaneously on the ball B ( u ¯ , δ ) . By condition ( AC ) 2 , for the same β we can choose δ (if necessary, a smaller one) so that for any u ∈ B ( u ¯ , δ ) , any v ∗ ∈ K + ∩ S Y ∗ , and any selections v ∈ M v ∗ ( u ) , v ¯ ∈ M v ∗ ( u ¯ ) ,
< ξ , u ¯ − u > − β ∥ u ¯ − u ∥ ≤ v ∗ ( v ¯ ) − v ∗ ( v ) ,
holds for all ξ ∈ ∂ F ( u , v ) ( v ∗ ) .
Adding inequalities (2) and (3): By using (2) and (3), we obtain
< ξ , u ¯ − u > ≤ 2 β ∥ u − u ¯ ∥ ,
which is precisely the characterization of u ¯ being a solution of P ( G M V I P ) with constant 2 β . We remark that the factor 2 in the constant 2 β arises from combining two separate inequalities, each valid with constant β . This is an artifact of the proof technique and does not represent a qualitative weakening of the result. □
In the following, we prove the relation between P ( G S V I P ) and (SLQE) by two theorems.
Theorem 2. 
Let u ¯ be a solution of P ( G S V I P ) with respect to β and F be approximately pseudoconvex of type II around u ¯ ∈ d o m F . Then u ¯ ∈ ( S L Q E ) .
Proof. 
Let u ¯ solve P ( G S V I P ) with respect to β . Then we can find δ > 0 , such that for each u ∈ B ( u ¯ , δ ) ∩ Ω , there exist v ¯ ∈ M v ∗ ( u ¯ ) and ξ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) such that
< ξ , u − u ¯ > + β ∥ u − u ¯ ∥ ≥ 0 .
Since F is approximately pseudoconvex of type II around u ¯ ∈ d o m F , then for every β > 0 there exists δ ′ > 0 , such that for any u ∈ B ( u ¯ , δ ′ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ and v ∈ M v ∗ ( u ) , if
< ξ , u − u ¯ > + β ∥ u − u ¯ ∥ ≥ 0 , for some ξ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) ,
then
v ∗ ( v ) ≥ v ∗ ( v ¯ ) .
Here, we use the same β in both the P ( G S V I P ) condition and the approximate pseudoconvexity of type II condition. This is permissible since approximate pseudoconvexity of type II is assumed to hold for all β > 0 . Let δ ¯ = min { δ , δ ′ } . Then from (4) and approximately pseudoconvex of type II of F , for every u ∈ B ( u ¯ , δ ¯ ) ∩ Ω it follows that
v ∗ ( v ¯ ) ≤ v ∗ ( v ) ≤ v ∗ ( v ) + β ∥ u − u ¯ ∥ .
Hence u ¯ ∈ ( S L Q E ) . □
Theorem 3. 
Let u ¯ ∈ ( S L Q E ) and F be approximately quasiconvex of type II around u ¯ . Then u ¯ is a solution of P ( G S V I P ) with respect to the same β.
Proof. 
Let u ¯ be a solution of (SLQE). Then, there exists β > 0 and we can find δ > 0 such that for each u ∈ B ( u ¯ , δ ) ∩ Ω , v ∗ ∈ K + ∖ { 0 } and v ∈ F ( u ) one has
v ∗ ( v ¯ ) ≤ v ∗ ( v ) + β ∥ u − u ¯ ∥ .
Since F is approximately quasiconvex of type II around u ¯ , therefore for all β > 0 we can find δ ′ > 0 such that for all u ∈ B ( u ¯ , δ ′ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ and v ∈ M v ∗ ( u ) , if
v ∗ ( v ¯ ) ≤ v ∗ ( v ) + β ∥ u − u ¯ ∥ ,
then
< ξ , u − u ¯ > ≤ 0 , ∀ ξ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) .
Let δ ¯ = min { δ , δ ′ } and u ¯ t = u ¯ + t ( u − u ¯ ) , t ∈ ( 0 , 1 ) such that t < δ ¯ . Then, from (5), it follows that
v ∗ ( v ¯ ) ≤ v ∗ ( v ¯ t ) + β ∥ u ¯ t − u ¯ ∥ .
From (6) and approximate quasiconvexity of type II of F , we get
< ξ t , u ¯ − u ¯ t > ≤ 0 , ∀ ξ t ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ )
That is,
< ξ t , u − u ¯ > ≥ 0 , ∀ ξ t ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) .
From (7), we have
< ξ t , u − u ¯ > + β ∥ u − u ¯ ∥ ≥ 0 .
Since ∂ F is closed, ξ t ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) , ξ t → ξ and ( u ¯ t , v ¯ t ) → ( u ¯ , v ¯ ) as t → 0 , we have ξ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) . The closedness of ∂ F here follows from the standard sequential closedness property of the Mordukhovich (limiting) subdifferential; see [22] for details. Therefore, for any u ∈ B ( u ¯ , δ ) ∩ Ω , there exists ξ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) , such that
< ξ , u − u ¯ > ≥ − β ∥ u − u ¯ ∥ .
□
In the following theorem, we prove that a solution of P ( G S V I P ) can be a solution of P ( G M V I P ) .
Theorem 4. 
Let u ¯ be a solution of P ( G S V I P ) with respect to β and ∂ F be approximately β-pseudomonotone. Then u ¯ is a solution of P ( G M V I P ) with respect to the same β.
Proof. 
Let u ¯ be a solution of P ( G S V I P ) with respect to β . Then we can find δ > 0 , such that for all u ∈ B ( u ¯ , δ ) ∩ Ω and v ∗ ∈ K + ∩ S Y ∗ , v ∈ M v ∗ ( u ) and ζ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) , we have
< ζ , u − u ¯ > + β ∥ u − u ¯ ∥ ≥ 0 .
Note that (8) matches the hypothesis of approximate β -pseudomonotonicity with the roles of u 1 = u ¯ and u 2 = u . Specifically, ζ ∈ ∂ F ( u ¯ , v ¯ ) ( v ∗ ) plays the role of the subdifferential element at u 2 , and the conclusion will give information about ξ ∈ ∂ F ( u , v ) ( v ∗ ) , the subdifferential element at u 1 . Since ∂ F is approximately β -pseudomonotone, then there exists 0 < δ ′ ≤ δ , such that from (8), for all u ∈ B ( u ¯ , δ ′ ) ∩ Ω , v ∗ ∈ K + ∩ S Y ∗ , v ∈ M v ∗ ( u ) and all ξ ∈ ∂ F ( u , v ) ( v ∗ ) we have
< ξ , u − u ¯ > ≥ 0 .
Since β > 0 , from (9), it follows that
< ξ , u − u ¯ > + β ∥ u − u ¯ ∥ ≥ 0 ,
then
< ξ , u ¯ − u > ≤ β ∥ u − u ¯ ∥ .
Hence, u ¯ is a solution of P ( G M V I P ) with respect to β . □
As a culmination of the preceding analysis on approximate convexity and variational inequalities, we now introduce a pivotal optimality concept for the subsequent discussion: the Locally Weak Quasi-Efficient (LWQE) Solution.
Definition 10. 
A point ( u ¯ , v ¯ ) ∈ gr F is an (LWQE) of problem (1) if there exist β > 0 and δ > 0 such that
( F ( u ) − v ¯ ) ∩ ( − β ∥ u − u ¯ ∥ e − i n t K ) = ∅ , ∀ u ∈ B ( u ¯ , δ ) ∩ Ω .
The following simple relation holds between these two concepts. The logical progression of our analysis now requires clarifying the hierarchy between solution concepts. Thus, the next proposition provides a key inclusion relation between the sets of (SLQE) and (LWQE) points.
Proposition 1. 
Every solution of (SLQE) is a (LWQE) of problem (1).
Proof. 
Suppose that ( u ¯ , v ¯ ) ∈ g r F is a solution of (SLQE) but not a (LWQE) solution of problem (1). Hence, for any β > 0 and δ > 0 there exist u ∈ B ( u ¯ , δ ) ∩ Ω and v ∈ F ( u ) such that
v − v ¯ + β ∥ u − u ¯ ∥ e ∈ − i n t K .
Now, by choosing v ∗ ∈ K + ∖ { 0 } such that v ∗ ( e ) = 1 , we have
v ∗ ( v ) − v ∗ ( v ¯ ) < − β ∥ u − u ¯ ∥ ,
which is a contradiction that ( u ¯ , v ¯ ) is a solution of (SLQE). □
Using Definition 10 and Proposition 1, the framework developed for analyzing relations among (SLQE), P ( G M V I P ) , and P ( G S V I P ) , we can prove the result for the case of (LWQE), P ( G M V I P ) , and P ( G S V I P ) .
Remark 2. 
Let u ¯ be a solution of P ( G S V I P ) with respect to β and suppose that F is approximately pseudoconvex of type II around u ¯ ∈ dom F . Then u ¯ is an (LWQE) of problem (1).
Remark 3 
(Stability of SLQE solutions). A natural question is whether approximate convexity provides some form of local robustness for SLQE solutions under small perturbations of the mapping F . Specifically, consider a family of set-valued mappings { F ϵ } ϵ > 0 converging to F in an appropriate sense (e.g., in terms of the Hausdorff metric on values). If F is approximately K -convex at u ¯ with constants β and δ, and if F ϵ → F uniformly on B ( u ¯ , δ ) , then for sufficiently small ϵ, the perturbed mapping F ϵ remains approximately K -convex at u ¯ with constants 2 β and δ / 2 . This follows from the triangle inequality and the definition of approximate K -convexity. Consequently, the (SLQE) property is locally robust under such perturbations, providing a degree of stability for the solution concept in practice.
Remark 4 
(Potential Applications). The theoretical framework developed in this paper has several potential applications:
1.
Multi-objective optimization: The approximate pseudoconvexity and quasiconvexity notions introduced here can serve as regularity conditions for characterizing Pareto-efficient solutions in vector optimization problems where the objective is modeled as a set-valued mapping.
2.
Economic equilibrium: In welfare economics and general equilibrium theory, set-valued excess demand correspondences naturally arise. The approximate convexity framework provides new tools for establishing the existence and characterization of equilibria in settings where classical convexity fails.
3.
Optimal control with set-valued dynamics: Differential inclusions and set-valued control systems can be analyzed using the subdifferential and variational inequality machinery developed here, particularly in establishing optimality conditions for trajectory optimization.
4.
Machine learning and robust optimization: The connections between approximate convexity and submonotonicity of subdifferentials parallel the relationships between approximate convexity and convergence of proximal-type algorithms, suggesting potential applications in non-convex optimization algorithms.

4. Conclusions

This article has introduced and analyzed new concepts of generalized convexity for set-valued mappings, namely approximate pseudoconvexity and approximate quasiconvexity. The motivation for these generalizations stems from the inherent limitations of classical convexity in handling multi-valued operators and vector-valued optimization structures, as well as the need to bridge the gap between approximate convexity theory for real-valued functions and the more general set-valued setting.
After that, we solved examples illustrating the relation between conditions ( AC ) 1 and ( AC ) 2 , and demonstrated the distinction between type I and type II notions. In particular, it was shown that ( AC ) 2 is strictly stronger than ( AC ) 1 , and that type II approximate pseudoconvexity and quasiconvexity are the appropriate conditions for the main variational inequality results.
Next, we investigated relations among (SLQE), P ( G M V I P ) , and P ( G S V I P ) and illustrated these notions with examples. The main theoretical contributions are as follows:
1.
Under condition ( AC ) 2 , every (SLQE) solution solves P ( G M V I P ) .
2.
Under approximate pseudoconvexity of type II, every solution of P ( G S V I P ) is an (SLQE) solution.
3.
Under approximate quasiconvexity of type II, every (SLQE) solution solves P ( G S V I P ) .
4.
Under approximate β -pseudomonotonicity of ∂ F , every solution of P ( G S V I P ) solves P ( G M V I P ) .
Finally, we defined the (LWQE) concept and showed its relationship to (SLQE), establishing that every (SLQE) solution is also an (LWQE) solution.
Several directions remain open for future investigation:
1.
Non-Lipschitz extensions: The current framework relies heavily on the Mordukhovich subdifferential and the approximate submonotonicity structure. A natural open question is whether the main equivalence results can be extended to non-Lipschitz set-valued mappings, perhaps by employing more general subdifferential constructions such as the Michel–Penot or Ioffe approximate subdifferentials.
2.
Reflexive Banach spaces with weaker topology: The results of this paper are stated in general Banach spaces. It would be of interest to investigate whether weakened topological assumptions (e.g., working with the weak topology on reflexive Banach spaces) allow for broader applicability, particularly in infinite-dimensional optimization and PDE-constrained optimization.
3.
Relationship with other generalized convexity notions: The connections between the approximate convexity framework developed here and other generalized convexity concepts, such as invexity, star-shapedness, and η -pseudoconvexity, deserve further investigation.
4.
Numerical methods: Developing proximal-type or descent algorithms that exploit the approximate convexity structure of set-valued mappings, and analyzing their convergence under the conditions introduced in this paper, represents an important direction for future computational work.

Funding

This work was supported by the Deanship of Graduate Studies and Scientific Research, Qassim University, Saudi Arabia, for funding the APC for this publication (QU-APC-2026).

Data Availability Statement

No data were used for the research described in this article.

Acknowledgments

The researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2026).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Jofre, A.; Luc, D.T.; Thera, M. ε-Subdifferential and ε-monotonicity. J. Nonlinear Anal. 1998, 33, 71–90. [Google Scholar] [CrossRef] [Scilit]
  2. Ngai, H.V.; Luc, D.T.; Thera, M. Approximate convex functions. J. Nonlinear Convex Anal. 2000, 1, 155–176. [Google Scholar]
  3. Gupta, P.; Mishra, S.K. On minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity. Optimization 2018, 67, 1157–1167. [Google Scholar] [CrossRef] [Scilit]
  4. Mishra, S.K.; Laha, V. On minty variational principle for nonsmooth vector optimization problems with approximate convexity. Optim. Lett. 2016, 10, 577–589. [Google Scholar] [CrossRef] [Scilit]
  5. Daniilidis, A.; Georgiev, P. Approximate convexity and submonotonicity. J. Math. Anal. Appl. 2004, 291, 292–301. [Google Scholar] [CrossRef] [Scilit]
  6. Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef] [Scilit]
  7. Malmir, F.; Barani, A. Generalized submonotonicity and approximately convexity in Riemannian manifolds. Rend. Del Circ. Mat. Palermo Ser. 2 2022, 71, 299–323. [Google Scholar] [CrossRef] [Scilit]
  8. Fatkhullin, I.; He, N.; Hu, Y. Stochastic optimization under hidden convexity. SIAM J. Optim. 2025, 35, 2544–2571. [Google Scholar] [CrossRef] [Scilit]
  9. Abdelhamid, M.; Czekanski, A. Revisiting non-convexity in topology optimization of compliance minimization problems. Eng. Comput. 2022, 39, 893–915. [Google Scholar] [CrossRef] [Scilit]
  10. Khanh, P.D.; Khoa, V.V.H.; Mordukhovich, B.S.; Phat, V.T. Local maximal monotonicity in variational analysis and optimization. Math. Oper. Res. 2025; ahead of print. [CrossRef] [Scilit]
  11. Olbrys, A. A support theorem for generalized convexity and its applications. J. Math. Anal. Appl. 2018, 458, 1044–1058. [Google Scholar] [CrossRef] [Scilit]
  12. Hien, D.V.; Anh, N.L.H. Existence of Solutions for Set Optimization Problems with Variable Ordering Structures. J. Optim. Theory Appl. 2025, 207, 59. [Google Scholar] [CrossRef] [Scilit]
  13. Eichfelder, G.; Gerlach, T.; Rocktäschel, S. Convexity and continuity of specific set-valued maps and their extremal value functions. J. Appl. Numer. Optim. 2023, 5, 1–25. [Google Scholar] [CrossRef] [Scilit]
  14. Eichfelder, G.; Rocktäschel, S. Solving set-valued optimization problems using a multiobjective approach. Optimization 2023, 72, 789–820. [Google Scholar] [CrossRef] [Scilit]
  15. Han, Y.; Huang, N. Continuity and convexity of a nonlinear scalarizing function in set optimization problems with applications. J. Optim. Theory Appl. 2017, 177, 331–344. [Google Scholar] [CrossRef] [Scilit]
  16. Seto, K.; Kuroiwa, D.; Popovici, N. A systematization of convexity and quasiconvexity concepts for set-valued maps, defined by l-type and u-type preorder relations. Optimization 2018, 67, 1077–1094. [Google Scholar] [CrossRef] [Scilit]
  17. Durea, M.; Strugariu, R. Directional derivatives and subdifferentials for set-valued maps applied to set optimization. J. Glob. Optim. 2022, 85, 687–707. [Google Scholar] [CrossRef] [Scilit]
  18. Oveisiha, M.; Aghabagloo, M. Scalarized solutions of set-valued optimization problems and generalized variational-like inequalities. Filomat 2017, 31, 3953–3963. [Google Scholar] [CrossRef] [Scilit]
  19. Oveisiha, M.; Zafarani, J. Super efficient solutions for set-valued maps. Optimization 2013, 62, 817–834. [Google Scholar] [CrossRef] [Scilit]
  20. Gfrerer, H. On second-order variational analysis of variational convexity of prox-regular functions. Set-Valued Var. Anal. 2025, 33, 8. [Google Scholar] [CrossRef] [Scilit]
  21. Khanh, P.D.; Mordukhovich, B.S.; Phat, V.T. Variational convexity of functions and variational sufficiency in optimization. SIAM J. Optim. 2023, 33, 1121–1158. [Google Scholar] [CrossRef] [Scilit]
  22. Mordukhovich, B.S. Variational Analysis and Generalized Differential I. Basic Theory, Grundlehren Ser., (Fundamental Principles of Mathematical Sciences), 330; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  23. Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–447. [Google Scholar] [CrossRef] [Scilit]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.