A revised pre-order principle and set-valued Ekeland variational principles with generalized distances

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.     

A Brézis-Browder principle on partially ordered spaces and related ordering theorems

Through a simple extension of Brézis-Browder principle to partially ordered spaces, a very general strong minimal point existence theorem on quasi ordered spaces, is proved. This theorem together with a generic quasi order and a new notion of strong approximate solution allow us to obtain two strong solution existence theorems, and three general Ekeland variational principles in optimization problems where the objective space is quasi ordered. Then, they are applied to prove strong minimal point existence results, generalizations of Bishop-Phelps lemma in linear spaces, and Ekeland variational principles in set-valued optimization problems through a set solution criterion.     

基于改进集的集值Ekeland变分原理

Ekeland变分原理在最优化理论及应用研究中具有十分重要的作用.利用非线性标量化函数及相应的非凸分离定理建立了基于改进集的集值Ekeland变分原理.新的Ekeland变分原理包含了一些经典的Ekeland变分原理作为其特例.     

The Ekeland variational principle for set-valued maps involving coderivatives

In this paper we use the Fréchet, Clarke, and Mordukhovich coderivatives to obtain variants of the Ekeland variational principle for a set-valued map F and establish optimality conditions for set-valued optimization problems. Our technique is based on scalarization with the help of a marginal function associated with F and estimates of subdifferentials of this function in terms of coderivatives of F.     

An equilibrium version of set-valued Ekeland variational principle and its applications to set-valued vector equilibrium problems

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 ob jective 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.     

Existence theorems for variational inclusion problems and the set-valued vector Ekeland variational principle in a complete metric space

In this paper, we apply an existence theorem for the variational inclusion problem to study the existence results for the variational intersection problems in Ekeland’s sense and the existence results for some variants of set-valued vector Ekeland variational principles in a complete metric space. Our results contain Ekeland’s variational principle as a special case and our approaches are different to those for any existence theorems for such problems.     

Variants of the Ekeland Variational Principle for a set-valued map involving the Clarke Normal Cone

In this paper we present two set-valued variants of the Ekeland variational principle involving the Clarke normal cone and establish sufficient conditions for a set-valued map to have a weak minimizer or a properly positive minimizer when it satisfies Palais-Smale type conditions.     

On Ha＇s Version of Set-valued Ekeland＇s Variational Principle

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.     

On Ekeland＇s Variational Principle for Set-Valued Mappings

In this paper, we derive a general vector Ekeland variational principle for set-valued mappings, which has a dosed relation to εk^0 -efficient points of set-valued optimization problems. The main result presented in this paper is a generalization of the corresponding result in [3].     

Vectorial variational principle with variable set-valued perturbation

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 ob jective 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.     

On extended versions of Dancs-Hegedüs-Medvegyev’s fixed-point theorem

In this article, we establish some fixed-point (known also as critical point, invariant point) theorems in quasi-metric spaces. Our results unify and further extend in some regards the fixed-point theorem proposed by Dancs, S.; Hegedüs, M.; Medvegyev, P. (A general ordering and fixed-point principle in complete metric space. Acta Sci. Math. 1983;46:381–388), the results given by Khanh, P.Q., Quy D.N. (A generalized distance and enhanced Ekeland?s variational principle for vector functions. Nonlinear Anal. 2010;73:2245–2259), the preorder principles established by Qiu, J.H. (A pre-order principle and set-valued Ekeland variational principle. J. Math. Anal. Appl. 2014;419:904–937) and the results obtained by Bao, T.Q., Mordukhovich, B.S., Soubeyran, A. (Fixed points and variational principles with applications to capability theory of wellbeing via variational rationality. Set-Valued Var. Anal. 2015;23:375–398). In addition, we provide examples to illustrate that the improvements of our results are significant.     

The Ekeland variational principle for Henig proper minimizers and super minimizers

In this paper we consider, for the first time, approximate Henig proper minimizers and approximate super minimizers of a set-valued map F with values in a partially ordered vector space and formulate two versions of the Ekeland variational principle for these points involving coderivatives in the sense of Ioffe, Clarke and Mordukhovich. As applications we obtain sufficient conditions for F to have a Henig proper minimizer or a super minimizer under the Palais-Smale type conditions. The techniques are essentially based on the characterizations of Henig proper efficient points and super efficient points by mean of the Henig dilating cones and the Hiriart-Urruty signed distance function.     

The strong Ekeland variational principle

In this paper, we consider the strong Ekeland variational principle due to Georgiev [P.G. Georgiev, The strong Ekeland variational principle, the strong drop theorem and applications, J. Math. Anal. Appl. 131 (1988) 1–21]. We discuss it for functions defined on Banach spaces and on compact metric spaces. We also prove the τ-distance version of it.     

Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle

This work deals with strict solutions of set-valued optimization problems under the set optimality criterion. In this context, we introduce a new approximate solution concept and we obtain several properties of these solutions when the error is fixed and also for their limit behavior when the error tends to zero. Then we prove a general existence result, which is applied to obtain approximate Ekeland variational principles.     

Generalized Gerstewitz's Functions and Vector Variational Principle for-Efficient Solutions in the Sense of Németh

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′emeth, 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.     

An Ekeland’s variational principle for set-valued mappings with applications

In this paper, we obtain a general Ekeland’s variational principle for set-valued mappings in complete metric space, which is different from those in [G.Y. Chen, X.X. Huang, Ekeland’s ε-variational principle for set-valued mapping, Mathematical Methods of Operations Research 48 (1998) 181–186; G.Y. Chen, X.X. Huang, S.H. Hou, General Ekeland’s Variational Principle for Set-Valued Mappings, Journal of Optimization Theory and Applications 106 (2000) 151–164; S.J. Li, W.Y. Zhang, On Ekeland’s variational Principle for set-valued mappings, Acta Mathematicae Application Sinica, English Series 23 (2007) 141–148]. By the result, we prove some existence results for a general vector equilibrium problem under nonconvex and compact or noncompact assumptions of its domain, respectively. Moreover, we give some equivalent results to the variational principle.     

Relative Pareto minimizers for multiobjective problems: existence and optimality conditions

In this paper we introduce and study enhanced notions of relative Pareto minimizers for constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency/minimality. Using advanced tools of variational analysis and generalized differentiation, we establish the existence of relative Pareto minimizers for general multiobjective problems under a refined version of the subdifferential Palais-Smale condition for set-valued mappings with values in partially ordered spaces and then derive necessary optimality conditions for these minimizers (as well as for conventional efficient and weak efficient counterparts) that are new in both finite-dimensional and infinite-dimensional settings. Our proofs are based on variational and extremal principles of variational analysis; in particular, on new versions of the Ekeland variational principle and the subdifferential variational principle for set-valued and single-valued mappings in infinite-dimensional spaces.     

Ekeland's ε-variational principle for set-valued mappings

In this paper, we introduce the concept of approximate solutions for set-valued mappings and provide a sufficient condition for the existence of approximate solutions of set-valued mappings. We obtain an approximate variational principle for set-valued mappings. Revised version received November 1997     

Characterizations of reflexivity and compactness via the strong Ekeland variational principle

It is well known that the famous Ekeland variational principle characterizes the metric completeness of underlying spaces. In this paper, we prove that some versions of the strong Ekeland variational principle characterize the reflexivity and the compactness of underlying spaces.