A projected subgradient method for solving a class of set-valued mixed variational inequalities （SMVIs） is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven tha...A projected subgradient method for solving a class of set-valued mixed variational inequalities （SMVIs） is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.展开更多
One of the classical approaches in the analysis of a variational inequality problem is to transform it into an equivalent optimization problem via the notion of gap function. The gap functions are useful tools in deri...One of the classical approaches in the analysis of a variational inequality problem is to transform it into an equivalent optimization problem via the notion of gap function. The gap functions are useful tools in deriving the error bounds which provide an estimated distance between a specific point and the exact solution of variational inequality problem. In this paper, we follow a similar approach for set-valued vector quasi variational inequality problems and define the gap functions based on scalarization scheme as well as the one with no scalar parameter. The error bounds results are obtained under fixed point symmetric and locally α-Holder assumptions on the set-valued map describing the domain of solution space of a set-valued vector quasi variational inequality problem.展开更多
This paper deals with Henig globally efficiency in vector optimization involving generalized cone-preinvex set-valued mapping. Some properties of generalized cone-preinvex set-valued map are derived. It also disclose ...This paper deals with Henig globally efficiency in vector optimization involving generalized cone-preinvex set-valued mapping. Some properties of generalized cone-preinvex set-valued map are derived. It also disclose the closed relationships between Henig globally efficiency of generalized conepreinvex set-valued optimization problem and Henig globally efficiency of a kind of vector variational inequality.展开更多
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 ne...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.展开更多
基金supported by the Key Program of National Natural Science Foundation of China(No.70831005)the National Natural Science Foundation of China(No.10671135)the Fundamental Research Funds for the Central Universities(No.2009SCU11096)
文摘A projected subgradient method for solving a class of set-valued mixed variational inequalities （SMVIs） is proposed when the mapping is not necessarily Lipschitz. Under some suitable conditions, it can be proven that the sequence generated by the method can strongly converge to the unique solution to the problem in the Hilbert spaces.
文摘One of the classical approaches in the analysis of a variational inequality problem is to transform it into an equivalent optimization problem via the notion of gap function. The gap functions are useful tools in deriving the error bounds which provide an estimated distance between a specific point and the exact solution of variational inequality problem. In this paper, we follow a similar approach for set-valued vector quasi variational inequality problems and define the gap functions based on scalarization scheme as well as the one with no scalar parameter. The error bounds results are obtained under fixed point symmetric and locally α-Holder assumptions on the set-valued map describing the domain of solution space of a set-valued vector quasi variational inequality problem.
基金supported by the Natural Science Foundation of China under Grant No.11361001Ministry of Education Science and technology key projects under Grant No.212204+1 种基金the Natural Science Foundation of Ningxia under Grant No.NZ12207the Science and Technology key project of Ningxia institutions of higher learning under Grant No.NGY2012092
文摘This paper deals with Henig globally efficiency in vector optimization involving generalized cone-preinvex set-valued mapping. Some properties of generalized cone-preinvex set-valued map are derived. It also disclose the closed relationships between Henig globally efficiency of generalized conepreinvex set-valued optimization problem and Henig globally efficiency of a kind of vector variational inequality.
基金Supported by National Natural Science Foundation of China(Grant No.10871141)
文摘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.
