Search

In this paper, we first generalize Gerstewitz's functions from a single positive vector to a subset of the positive cone. Then, we establish a partial order principle, which is indeed a variant of the pre-order principle [Qiu, J. H.: A pre-order principle and set-valued Ekeland variational principle. J. Math. Anal. Appl., 419, 904-937 (2014)]. By using the generalized Gerstewitz's functions and the partial order principle, we obtain a vector EVP for ε-efficient solutions in the sense of Németh, which essentially improves the earlier results by completely removing a usual assumption for boundedness of the objective function. From this, we also deduce several special vector EVPs, which improve and generalize the related known results. [ABSTRACT FROM AUTHOR]

In my former paper 'A pre-order principle and set-valued Ekeland variational principle' (see [ J. Math. Anal. Appl., 419, 904-937 (2014)]), we established a general pre-order principle. From the pre-order principle, we deduced most of the known set-valued Ekeland variational principles (denoted by EVPs) in set containing forms and their improvements. But the pre-order principle could not imply Khanh and Quy's EVP in [On generalized Ekeland's variational principle and equivalent formulations for set-valued mappings, J. Glob. Optim., 49, 381-396 (2011)], where the perturbation contains a weak τ-function, a certain type of generalized distances. In this paper, we give a revised version of the pre-order principle. This revised version not only implies the original pre-order principle, but also can be applied to obtain the above Khanh and Quy's EVP. In particular, we give several new set-valued EVPs, where the perturbations contain convex subsets of the ordering cone and various types of generalized distances. [ABSTRACT FROM AUTHOR]

By using Gerstewitz functions, we establish a new equilibrium version of Ekeland variational principle, which improves the related results by weakening both the lower boundedness and the lower semi-continuity of the objective bimaps. Applying the new version of Ekeland principle, we obtain some existence theorems on solutions for set-valued vector equilibrium problems, where the most used assumption on compactness of domains is weakened. In the setting of complete metric spaces ( Z, d), we present an existence result of solutions for set-valued vector equilibrium problems, which only requires that the domain X ⊂ Z is countably compact in any Hausdorff topology weaker than that induced by d. When ( Z, d) is a Féchet space (i.e., a complete metrizable locally convex space), our existence result only requires that the domain X ⊂ Z is weakly compact. Furthermore, in the setting of non-compact domains, we deduce several existence theorems on solutions for set-valued vector equilibrium problems, which extend and improve the related known results. [ABSTRACT FROM AUTHOR]

By using sequentially lower complete spaces (see [Zhu, J., Wei, L., Zhu, C. C.: Caristi type coincidence point theorem in topological spaces. J. Applied Math., 2013, ID 902692 (2013)]), we give a new version of vectorial Ekeland's variational principle. In the new version, the objective function is defined on a sequentially lower complete space and taking values in a quasi-ordered locally convex space, and the perturbation consists of a weakly countably compact set and a non-negative function p which only needs to satisfy p( x, y) = 0 iff x = y. Here, the function p need not satisfy the subadditivity. From the new Ekeland's principle, we deduce a vectorial Caristi's fixed point theorem and a vectorial Takahashi's non-convex minimization theorem. Moreover, we show that the above three theorems are equivalent to each other. By considering some particular cases, we obtain a number of corollaries, which include some interesting versions of fixed point theorem. [ABSTRACT FROM AUTHOR]

We give a general vectorial Ekeland's variational principle, where the objective function is defined on an F-type topological space and taking values in a pre-ordered real linear space. Being quite different from the previous versions of vectorial Ekeland's variational principle, the perturbation in our version is no longer only dependent on a fixed positive vector or a fixed family of positive vectors. It contains a family of set-valued functions taking values in the positive cone and a family of subadditive functions of topology generating quasi-metrics. Hence, the direction of the perturbation in the new version is a family of variable subsets which are dependent on the objective function values. The general version includes and improves a number of known versions of vectorial Ekeland's variational principle. From the general Ekeland's principle, we deduce the corresponding versions of Caristi-Kirk's fixed point theorem and Takahashi's nonconvex minimization theorem. Finally, we prove that all the three theorems are equivalent to each other. [ABSTRACT FROM AUTHOR]

In this paper, by using p-distances on uniform spaces, we establish a general vectorial Ekeland variational principle (in short EVP), where the objective function is defined on a uniform space and taking values in a pre-ordered real linear space and the perturbation involves a p-distance and a monotone function of the objective function. Since p-distances are very extensive, such a form of the perturbation in deed contains many different forms of perturbations appeared in the previous versions of EVP. Besides, we only require the objective function has a very weak property, as a substitute for lower semi-continuity, and only require the domain space (which is a uniform space) has a very weak type of completeness, i.e., completeness with respect to a certain p-distance. Such very weak type of completeness even includes local completeness when the uniform space is a locally convex topological vector space. From the general vectorial EVP, we deduce a general vectorial Caristi's fixed point theorem and a general vectorial Takahashi's nonconvex minimization theorem. Moreover, we show that the above three theorems are equivalent to each other. We see that the above general vectorial EVP includes many particular versions of EVP, which extend and complement the related known results. [ABSTRACT FROM AUTHOR]

By using the concept of cone extensions and Dancs-Hegedus-Medvegyev theorem, Ha [Some variants of the Ekeland variational principle for a set-valued map. J. Optim. Theory Appl., 124, 187-206 (2005)] established a new version of Ekeland's variational principle for set-valued maps, which is expressed by the existence of strict approximate minimizer for a set-valued optimization problem. In this paper, we give an improvement of Ha's version of set-valued Ekeland's variational principle. Our proof is direct and it need not use Dancs-Hegedus-Medvegyev theorem. From the improved Ha's version, we deduce a Caristi-Kirk's fixed point theorem and a Takahashi's nonconvex minimization theorem for set-valued maps. Moreover, we prove that the above three theorems are equivalent to each other. [ABSTRACT FROM AUTHOR]

In this paper, we attempt to give a unified approach to the existing several versions of Ekeland's variational principle. In the framework of uniform spaces, we introduce p-distances and more generally, q-distances. Then we introduce a new type of completeness for uniform spaces, i.e., sequential completeness with respect to a q-distance (particularly, a p-distance), which is a very extensive concept of completeness. By using q-distances and the new type of completeness, we prove a generalized Takahashi's nonconvex minimization theorem, a generalized Ekeland's variational principle and a generalized Caristi's fixed point theorem. Moreover, we show that the above three theorems are equivalent to each other. From the generalized Ekeland's variational principle, we deduce a number of particular versions of Ekeland's principle, which include many known versions of the principle and their improvements. [ABSTRACT FROM AUTHOR]

In the framework of topological vector spaces, we give a characterization of strong Minkowski separation, introduced by Cheng, et al., in terms of convex body separation. From this, several results on strong Minkowski separation are deduced. Using the results, we prove a drop theorem involving weakly countably compact sets in locally convex spaces. Moreover, we introduce the notion of the co-drop property and show that every weakly countably compact set has the co-drop property. If the underlying locally convex space is quasi-complete, then a bounded weakly closed set has the co-drop property if and only if it is weakly countably compact. [ABSTRACT FROM AUTHOR]