Search

In this paper, we establish Lipschitz continuity of strongly efficient approximate solution mapping to parametric generalized vector equilibrium problems without using monotonicity and any information of the solution mappings. Moreover, we make a new attempt to establish Lipschitz continuity of weakly efficient approximate solution mapping and efficient approximate solution mapping to parametric generalized vector equilibrium problems by using a scalarization method and a density result, respectively. As an application of the main results, we obtain Lipschitz continuity of strongly efficient approximate solution mapping, weakly efficient approximate solution mapping and efficient approximate solution mapping to parametric vector optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, quasi-strict feasibility of a generalized mixed variational inequality as a new notation is introduced, which is weaker than its strict feasibility and recovers the existing concept of strict feasibility for a generalized variational inequality. By using the equivalent characterization of the nonemptiness and boundedness of the solution set for the generalized mixed variational inequality, it is proved that quasi-strict feasibility is a sufficient condition for the generalized mixed variational inequality with a f-pseudomonotone and upper hemicontinuous mapping to have a nonempty and bounded solution set in reflexive Banach spaces. Our results generalize and extend some known results in Zhong and Huang (J Optim Theory Appl 152(3):696-709, 2012). [ABSTRACT FROM AUTHOR]

In this paper, a key assumption similar to that of Li and Chen is introduced by virtue of a gap function for a class of parametric set-valued weak vector variational inequalities in Banach spaces. By using this key assumption, sufficient and necessary conditions of the continuity and Hausdorff continuity of the solution set mapping for such parametric set-valued weak vector variational inequalities are given in Banach spaces when the image space is infinite dimensional. The results presented in this paper generalize and improve some main results of Li and Chen. [ABSTRACT FROM AUTHOR]

In this paper, we first obtain an existence theorem of the solutions for a variational relation problem. An existence theorem for a variational inclusion problem, a KKM theorem and an extension of the well know Ky Fan inequality will be established, as particular cases. Some applications concerning a saddle point problem with constraints, existence of a common fixed point for two mappings and an optimization problem with constraints, will be given in the last section of the paper. [ABSTRACT FROM AUTHOR]

In this paper, we investigate weak vector solutions and global vector solutions to a generalized Ky Fan inequality. Under new assumptions, which are weaker than the assumption of strict C-mappings, we establish the lower semicontinuity of the solution mappings to a parametric generalized Ky Fan inequality by using a scalarization method. These results extend the corresponding ones in the literature. Some examples are given to illustrate our results. [ABSTRACT FROM AUTHOR]

The duality of multiobjective problems is studied with the help of the apparatus of conjugate set-valued mappings introduced by the author. In this paper (Part 1), a duality theory is developed for set-valued mappings, which is then used to derive dual relations for some general multiobjective optimization problems which include convex programming and optimal control problems. Using this result, in the companion paper (Part 2), duality theorems are proved for multiobjective quasilinear and linear optimal control problems. The theory is applied to get dual relations for some multiobjective optimal control problem. [ABSTRACT FROM AUTHOR]

In this paper, we study vector quasi-equilibrium problems for the sum of two multivalued bifunctions. The assumptions are required separately on each of these bifunctions. Sufficient conditions for the existence of solutions of such problems are shown in the setting of topological vector spaces. The results in this paper unify, improve and extend some well-known existence theorems from the literature. [ABSTRACT FROM AUTHOR]

This paper gives sufficient conditions for the lower and upper semicontinuities of the solution mapping of a model, called the parametric bifunction-set optimization problem, which provides a bridge between several parametric set optimization problems and parametric generalized vector Ky Fan inequality problems. Our main theorems, applied to the just mentioned problems, give some new or sharper results. [ABSTRACT FROM AUTHOR]

We introduce in the present paper a Gauss-Newton-type method for solving generalized equations defined by sums of differentiable mappings and set-valued mappings in Banach spaces. Semi-local convergence and local convergence of the Gauss-Newton-type method are analyzed. [ABSTRACT FROM AUTHOR]

In this paper, we construct a new projection method and prove the strong convergence for finding a common element of a set of fixed points of strict pseudo-contractions and a set of solutions of a variational inequality with inverse strongly monotone mappings in the setting of real Hilbert spaces. Our results improve and extend the recent results by Huang, Noor, and Al-Said (J. Optim. Theory Appl. 147(1):194-204, ), Takahashi and Toyoda (J. Optim. Theory Appl. 118(2):417-428, ). [ABSTRACT FROM AUTHOR]

In this paper, by using a scalarization technique, we obtain sufficient conditions for Hölder continuity of the solution mapping for a parametric weak generalized Ky Fan Inequality in the case where the solution mapping is a general set-valued one. The result is different from the recent ones in the literature. [ABSTRACT FROM AUTHOR]

This paper is devoted to the stability analysis for a class of Minty mixed variational inequalities in reflexive Banach spaces, when both the mapping and the constraint set are perturbed. Several equivalent characterizations are given for the Minty mixed variational inequality to have nonempty and bounded solution set. A stability result is presented for the Minty mixed variational inequality with Φ-pseudomonotone mapping in reflexive Banach space, when both the mapping and the constraint set are perturbed by different parameters. As an application, a stability result for a generalized mixed variational inequality is also obtained. The results presented in this paper generalize and extend some known results in Fan and Zhong (Nonlinear Anal., Theory Methods Appl. 69:2566-2574, ) and He (J. Math. Anal. Appl. 330:352-363, ). [ABSTRACT FROM AUTHOR]

This paper considers the following generalized vector quasiequilibrium problem: find a point ( z 0, x 0) of a set E× K such that x 0∈ A( z 0, x 0) and where α is a subset of 2 Y ×2 Y , A: E× K→2 K , B: E× K× K→2 E , C: E× K× K→2 Y , F: E× K× K→2 Y are set-valued maps and Y is a topological vector space. Existence theorems are established under suitable assumptions, one of which is the requirement of the openness of the lower sections of some set-valued maps which can be satisfied with maps B, C, F being discontinuous. It is shown that, in some special cases, this requirement can be verified easily by using the semicontinuity property of these maps. Another assumption in the obtained existence theorems is assured by appropriate notions of diagonal quasiconvexity. [ABSTRACT FROM AUTHOR]

Variational-like inequalities with set-valued mappings are very useful in economics and nonsmooth optimization problems. In this paper, we study the existence of solutions and the formulation of solution methods for vector variational-like inequalities (VVLI) with set-valued mappings. We introduce gap functions and establish necessary and sufficient conditions for the existence of a solution of the VVLI. We investigate the existence of a solution for the generalized VVLI with a set-valued mapping by exploiting the existence of a solution of the VVLI with a single-valued function and a continuous selection theorem. [ABSTRACT FROM AUTHOR]

This paper develops boundary integral representation formulas for the second variations of cost functionals for elliptic domain optimization problems. From the collection of all Lipschitz domains Ω which satisfy a constraint ∫Ω g(x) dx = 1, a domain is sought which maximizes either Fx0(Ω) = F(x0,u(x0)), fixed x0 ∈ Ω, or F(Ω) = ∫Ω F(x,u(x))dx, where u solves the Dirichlet problem Δu(x) = -f (x), x ∈ Ω, u(x) = 0, x ∈ ∂Ω. Necessary and sufficient conditions for local optimality are presented in terms of the first and second variations of the cost functionals Fx0 and F. The second variations are computed with respect to domain variations which preserve the constraint. After first summarizing known facts about the first variations of u and the cost functionals, a series of formulas relating various second variations of these quantities are derived. Calculating the second variations depends on finding first variations of solutions u when the data f are permitted to depend on the domain Ω. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of (Benson) proper subgradient of a set-valued map and prove that, for some class of nonconvex set-valued maps, a proper subgradient of the sum of two set-valued maps can be expressed as the sum of two proper subgradients of these maps. This property is also established for weak subgradients. A result in Ref. [Lin, L.J.: J. Math. Anal. Appl. 186, 30-51 (1994)], obtained under some convexity assumption, is included as a special case of the corresponding result of this paper. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new class of vector quasi-equilibrium problems with set-valued maps. Almost all the vector equilibrium models of the Blum-Oettli type in the literature are special cases of our new class of equilibrium problems under consideration. Moreover, a number of C-diagonal quasiconvexity properties are proposed for set-valued maps, which are natural generalizations of the γ-diagonal quasiconvexity for real functions. Together with an application of continuous selection and fixed-point theorems, these conditions enable us to prove unified existence results of solutions for such vector equilibrium problems. [ABSTRACT FROM AUTHOR]

This paper gives several characterizations of nearly subconvexlike set-valued maps (see Ref. 1) and shows that a weakly efficient solution and a Benson properly efficient solution of a vector optimization problem with nearly-subconvexlike objectives and constraints can be expressed in terms of saddle points defined in a suitable sense. [ABSTRACT FROM AUTHOR]

In this paper, several kinds of invariant monotone maps and generalized invariant monotone maps are introduced. Some examples are given which show that invariant monotonicity and generalized invariant monotonicity are proper generalizations of monotonicity and generalized monotonicity. Relationships between generalized invariant monotonicity and generalized invexity are established. Our results are generalizations of those presented by Karamardian and Schaible. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid projection algorithm for a countable family of mappings is considered in Banach spaces. The sequence generated by algorithm converges strongly to the common fixed point of the mappings. We apply the result for the resolvent of a maximal monotone operator for finding a zero of it, which is a solution of the equilibrium problem. The results obtained extend the research in this context, such as the corresponding results of Aoyama et al. (Nonlinear Anal 71(12):1626-1632, 2009, nonlinear analysis and optimization, Yokohama Publishers, Yokohama, pp. 1-17, 2009), Solodov et al. (Math Program 87(1):189-202, 2000), Ohsawa et al. (Arch Math 81(4):439-445, 2003) and Kamimura et al. (SIAM J Optim 13(3):938-945, 2002). [ABSTRACT FROM AUTHOR]

In this paper, we present a generalized vector-valued proximal point algorithm for convex and unconstrained multi-objective optimization problems. Our main contribution is the introduction of quasi-distance mappings in the regularized subproblems, which has important applications in the computer theory and economics, among others. By considering a certain class of quasi-distances, that are Lipschitz continuous and coercive in any of their arguments, we show that any sequence generated by our algorithm is bounded and its accumulation points are weak Pareto solutions. [ABSTRACT FROM AUTHOR]

In this paper, a systematic study of the strong metric subregularity property of mappings is carried out by means of a variational tool, called steepest displacement rate. With the aid of this tool, a simple characterization of strong metric subregularity for multifunctions acting in metric spaces is formulated. The resulting criterion is shown to be useful for establishing stability properties of the strong metric subregularity in the presence of perturbations, as well as for deriving various conditions, enabling one to detect such a property in the case of nonsmooth mappings. Some of these conditions, involving several nonsmooth analysis constructions, are then applied in studying the isolated calmness property of the solution mapping to parameterized generalized equations. [ABSTRACT FROM AUTHOR]

In this paper, we derive exact chain rules for a proper epsilon-subdifferential in the sense of Benson of extended vector mappings, recently introduced by ourselves. For this aim, we use a new regularity condition and a new strong epsilon-subdifferential for vector mappings. In particular, we determine chain rules when one of the mappings is linear, obtaining formulations easier to handle in the finite-dimensional case by considering the componentwise order. This Benson proper epsilon-subdifferential generalizes and improves several of the most important proper epsilon-subdifferentials of vector mappings given in the literature and, consequently, the results presented in this work extend known chain rules stated for the last ones. As an application, we derive a characterization of approximate Benson proper solutions of implicitly constrained convex Pareto problems. Moreover, we estimate the distance between the objective values of these approximate proper solutions and the set of nondominated attained values. [ABSTRACT FROM AUTHOR]

In this paper, we give a comparison of Brezis pseudomonotonicity and Ky Fan hemicontinuity on infinite dimensional reflexive Banach spaces from the point of view of equivalence. Moreover, some existence results on variational inequalities are given, and it is shown that the solution set of variational inequality related to a Brezis pseudomonotone mapping is weakly closed and weakly compact when the mapping satisfies some coercive conditions. [ABSTRACT FROM AUTHOR]

In this paper, a notion called proximally complete pair of subsets of a metric space is introduced, which weakens earlier notions in the theory of best-proximity points. By means of this notion, existence and convergence results of best-proximity points are proven for cyclic contraction mappings, which extent other recent results. By observing geometrical properties of Hilbert spaces, the so-called Pythagorean property is introduced. This property is employed to provide sufficient conditions for a cyclic map to be a cyclic contraction. [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to introduce the notion of weakly upper semicontinuous set-valued maps and to establish a new fixed-point theorem. The set-valued maps with an approximating upper semicontinuous selection property are also defined. Next, we use our fixed-point result to obtain equilibrium existence in abstract economies with two constraints, which provide a natural scenario for potential applications of our approach to general equilibrium theory. In this regard, we set models of economies with asymmetric informed agents, who are able to improve their initial information through market signals. These economies offer examples in which the informational feasibility requirement represents an additional constraint. [ABSTRACT FROM AUTHOR]

Multiobjective optimization problems with a variable ordering structure, instead of a partial ordering, have recently gained interest due to several applications. In the previous years, a basic theory has been developed for such problems. The binary relations of a variable ordering structure are defined by a cone-valued map that associates, with each element of the linear space ℝ, a pointed convex cone of dominated or preferred directions. The difficulty in the study of the variable ordering structures arises from the fact that the binary relations are in general not transitive. In this paper, we propose numerical approaches for solving such optimization problems. For continuous problems a method is presented using scalarization functionals, which allows the determination of an approximation of the infinite optimal solution set. For discrete problems the Jahn-Graef-Younes method, known from multiobjective optimization with a partial ordering, is adapted to allow the determination of all optimal elements with a reduced effort compared to a pairwise comparison. [ABSTRACT FROM AUTHOR]

In this paper, we extend the concept of monotonicity for a vector set-valued mapping to semimonotonicity for a vector set-valued mapping. Then, we prove solvability results for a class of new generalized mixed vector variational-like inequalities by applying the Fan-KKM theorem and Nadler's result. On the other hand, we introduce the concepts of complete semicontinuity and strong semicontinuity for vector multivalued mappings. Moreover, by using the Brouwer fixed point theorem, we prove the solvability for the class of generalized vector variational-like inequalities without monotonicity assumption. Using this result, we obtain a theorem and corollary that improve and extend some known results. [ABSTRACT FROM AUTHOR]

This paper proposes a robust pole placement method for the joint dynamical models of flexible manipulators with parametric uncertainty. The proposed method incorporates Kharitonov's theorem, the Routh-Hurwitz criterion, and the mapping theory. All system poles can be placed in a specified trapezoid region such that control system performance can be predefined. [ABSTRACT FROM AUTHOR]

In this paper, in order to solve a variational inequality problem over the set of common fixed points of an infinite family of nonexpansive mappings on a real reflexive and strictly convex Banach space with a uniformly Gâteaux differentiable norm, we introduce two new implicit iteration methods. Their strong convergence is proved, by using new V-mappings instead of W-ones. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new parallel splitting augmented Lagrangian method for solving the nonlinear programs where the objective function is separable with three operators and the constraint is linear. The method is an improvement of the method of He (Comput. Optim. Appl., 2(42):195-212, ), where we generate a predictor using the same parallel splitting augmented Lagrangian scheme as that in He (Comput. Optim. Appl., 2(42):195-212, ), while adopting a new strategy to get the next iterate. Under the mild assumptions of convexity of the underlying mappings and the non-emptiness of the solution set, we prove that the proposed algorithm is globally convergent. We apply the new method in the area of image processing and to solve some quadratic programming problems. The preliminary numerical results indicate that the new method is efficient. [ABSTRACT FROM AUTHOR]

This paper is mainly concerned with the stability analysis of the set-valued solution mapping for a parametric quasivariational inequality of Ky Fan type. Perturbations are here considered both on the bifunction and on the constraint map which define the problem. The bifunction is assumed to be either pseudomonotone or quasimonotone. This fact leads to the definition of four different types of solution: two when the bifunction is pseudomonotone, and two for the quasimonotone case. These solution sets are connected each other through two Minty-type Lemmas, where a very weak form of continuity for the bifunction is employed. Using these results, we are able to establish some sufficient conditions, which ensure the closedness and the upper semicontinuity of the maps corresponding to the four solution sets. [ABSTRACT FROM AUTHOR]

This paper establishes an upper estimate for the Fréchet normal cone to the graph of the nonlinearly perturbed polyhedral normal cone mappings in finite dimensional spaces. Under a positive linear independence assumption on the normal vectors of the active constraints at the point in question, the result leads to an upper estimate for values of the Mordukhovich coderivative of such mappings. On the basis, new results on solution stability of parametric affine variational inequalities under nonlinear perturbations are derived. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new class of operators. We present some fundamental properties of the operators belonging to this class and, as applications, we establish some existence results of the solutions for several general variational inequalities involving elements belonging to this class. [ABSTRACT FROM AUTHOR]

Second-order cone (SOC) is a typical subclass of nonpolyhedral symmetric cones and plays a fundamental role in the second-order cone programming. It is already proven that the metric projection mapping onto SOC is strongly semismooth everywhere. However, whether such property holds for each slice of SOC has not been known yet. In this paper, by virtue of a new property of projection onto the closed and convex set with sufficiently smooth boundary, and some new results about projection onto axis-weighted SOC, we give an affirmative answer to this problem. Meanwhile, we also show Clarke's generalized Jacobian and the directional derivative for the projection mapping onto a slice of SOC. [ABSTRACT FROM AUTHOR]

This paper deals with a method for approximating a solution of the following problem: find hierarchically a common fixed point of a finite family of nonself nonexpansive mappings with respect to a nonexpansive self mapping on a closed convex subset of a smooth and reflexive Banach space X, which admits a weakly sequentially continuous duality mapping. First, we prove a weak convergence theorem which extends and improves one recent result proved by Yao and Liou (see Inverse Problems 24 (), doi:). Secondly, when the self mapping is a contraction, we prove, under different restrictions on parameters, a strong convergence result which generalize some recent results in the literature. [ABSTRACT FROM AUTHOR]

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions. [ABSTRACT FROM AUTHOR]

In this paper, by using the scalarization approach of Konnov, several kinds of strong and weak scalar variational inequalities (SVI and WVI) are introduced for studying strong and weak vector variational inequalities (SVVI and WVVI) with set-valued mappings, and their gap functions are suggested. The equivalence among SVVI, WVVI, SVI, WVI is then established under suitable conditions and the relations among their gap functions are analyzed. These results are finally applied to the error bounds for gap functions. Some existence theorems of global error bounds for gap functions are obtained under strong monotonicity and several characterizations of global (respectively local) error bounds for the gap functions are derived. [ABSTRACT FROM AUTHOR]

In this paper, we introduce some iterative algorithms for finding a common element of the set of solutions of a mixed equilibrium problem, the set of fixed points of a strict pseudocontraction and the set of solutions of a variational inequality for a monotone, Lipschitz continuous mapping. We obtain both weak and strong convergence theorems for the sequences generated by these processes in Hilbert spaces. [ABSTRACT FROM AUTHOR]

Let C be a nonempty closed convex subset of a Banach space E with the dual E*, let T: C→ E* be a Lipschitz continuous mapping and let S: C→ C be a relatively nonexpansive mapping. In this paper, by employing the notion of generalized projection operator, we study the following variational inequality (for short, VI( T− f, C)): find x∈ C such that where f∈ E* is a given element. Utilizing the modified Ishikawa iteration and the modified Halpern iteration for relatively nonexpansive mappings, we propose two modified versions of J.L. Li’s (J. Math. Anal. Appl. 295:115–126, ) iterative algorithm for finding approximate solutions of VI( T− f, C). Moreover, it is proven that these iterative algorithms converge strongly to the same solution of VI( T− f, C), which is also a fixed point of S. [ABSTRACT FROM AUTHOR]

In the solution methods of the symmetric cone complementarity problem (SCCP), the squared norm of a complementarity function serves naturally as a merit function for the problem itself or the equivalent system of equations reformulation. In this paper, we study the growth behavior of two classes of such merit functions, which are induced by the smooth EP complementarity functions and the smooth implicit Lagrangian complementarity function, respectively. We show that, for the linear symmetric cone complementarity problem (SCLCP), both the EP merit functions and the implicit Lagrangian merit function are coercive if the underlying linear transformation has the P-property; for the general SCCP, the EP merit functions are coercive only if the underlying mapping has the uniform Jordan P-property, whereas the coerciveness of the implicit Lagrangian merit function requires an additional condition for the mapping, for example, the Lipschitz continuity or the assumption as in (45). [ABSTRACT FROM AUTHOR]

We apply the Himmelberg fixed-point theorem to establish existence theorems of equilibria for generalized abstract economies with two constraint correspondences in which the strategic spaces may not be compact and the set of players may not be countable. Our results have applications in other sciences or disciplines (e.g. game theory, optimization theory and economics) in our subsequent paper. [ABSTRACT FROM AUTHOR]

In this paper, we introduce new dual problems of generalized vector variational inequality problems with set-valued maps and we discuss a link between the solution sets of the primal and dual problems. The notion of solutions in each of these problems is introduced via the concepts of efficiency, weak efficiency or Benson proper efficiency in vector optimization. We provide also examples showing that some earlier duality results for vector variational inequality may not be true. [ABSTRACT FROM AUTHOR]

In this paper, we analyze various control algorithms that have been proposed for controlling spatiotemporal chaos in a globally coupled map lattice (CML) system. We reformulate the choice of feedback parameters in such systems as a constrained optimization problem and provide numerical and experimental results on the choice of optimal parameters for controlling the mean global Lyapunov exponent of a lattice. Finally, we propose a scheme to use this optimization technique to solve a learning problem in which such a CML system can be used to emulate the dynamics of an epileptic brain. [ABSTRACT FROM AUTHOR]

In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T. (eds.) Nonlinear analysis and convex analysis, pp. 221-228, 1999).We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given. [ABSTRACT FROM AUTHOR]

In this paper, we study the chaotic numbers of complete bipartite graphs and complete tripartite graphs. For the complete bipartite graphs, we find closed-form formulas of the chaotic numbers and characterize all chaotic mappings. For the complete tripartite graphs,we develop an algorithm running in O(n34) time to find the chaotic numbers, with n3 the number of vertices in the largest partite set. [ABSTRACT FROM AUTHOR]

In this paper, two concepts of well-posedness for quasivariational inequalities having a unique solution are introduced. Some equivalent characterizations of these concepts and classes of well-posed quasivariational inequalities are presented. The corresponding concepts of well-posedness in the generalized sense are also investigated for quasivariational inequalities having more than one solution. [ABSTRACT FROM AUTHOR]

In this paper, we introduce an iterative process for finding the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping. The iterative process is based on the so-called extragradient method. We obtain a weak convergence theorem for two sequences generated by this process. [ABSTRACT FROM AUTHOR]

In this paper, we propose second-order epiderivatives for set-valued maps. By using these concepts, second-order necessary optimality conditions and a sufficient optimality condition are given in set optimization. These conditions extend some known results in optimization. [ABSTRACT FROM AUTHOR]

This paper deals with the Ekeland variational principle (EVP) for a set-valued map F with values in a vector space E. Using the concept of cone extension and the Mordukhovich coderivative, we formulate some variants of the EVP for F under various continuity assumptions. We investigate also the stability of a set-valued EVE Our approach is motivated by the set approach proposed by Kuroiwa for minimizing set-valued maps. [ABSTRACT FROM AUTHOR]