VECTORIAL EKELAND'S VARIATIONAL PRINCIPLE WITH A W-DISTANCE AND ITS EQUIVALENT THEOREMS

By using the properties of w-distances and Gerstewitz＇s functions, we first give a vectorial Takahashi＇s nonconvex minimization theorem with a w-distance. From this, we deduce a general vectorial Ekeland＇s variational principle, where the objective function is from a complete metric space into a pre-ordered topological vector space and the perturbation contains a w-distance and a non-decreasing function of the objective function value. From the general vectorial variational principle, we deduce a vectorial Caristfs fixed point theorem with a w-distance. Finally we show that the above three theorems are equivalent to each other. The related known results are generalized and improved. In particular, some conditions in the theorems of [Y. Araya, Ekeland＇s variational principle and its equivalent theorems in vector optimization, J. Math. Anal. Appl. 346（2008）, 9-16] are weakened or even completely relieved.

A Kind of Equivalence of Three Nonlinear Scalarization Functions in Vector Optimization

In this paper,by the notions of base functionals and augmented dual cones,the authors indicate firstly that the norms,Gerstewitz functionals and oriented distance functions have common characteristics with base functionals.After that,the equivalence of these three sublinear functions on the ordering cone is established by using the structures of augmented dual cones under the assumption that it has a bounded base.However,the authors show that two superlinear functions do not have similar relations with the norms ahead.More generally,the equivalence of three sublinear functions outside the negative cone has also been obtained in the end.

A General Vectorial Ekeland's Variational Principle with a P-distance

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.