In this paper,we investigate dual problems for nonconvex set-valued vector optimization via abstract subdifferential.We first introduce a generalized augmented Lagrangian function induced by a coupling vector-valued f...In this paper,we investigate dual problems for nonconvex set-valued vector optimization via abstract subdifferential.We first introduce a generalized augmented Lagrangian function induced by a coupling vector-valued function for set-valued vector optimization problem and construct related set-valued dual map and dual optimization problem on the basic of weak efficiency,which used by the concepts of supremum and infimum of a set.We then establish the weak and strong duality results under this augmented Lagrangian and present sufficient conditions for exact penalization via an abstract subdifferential of the object map.Finally,we define the sub-optimal path related to the dual problem and show that every cluster point of this sub-optimal path is a primal optimal solution of the object optimization problem.In addition,we consider a generalized vector variational inequality as an application of abstract subdifferential.展开更多
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 National Science Foundation of China(No.11401487)the Education Department of Shaanxi Province(No.17JK0330)+1 种基金the Fundamental Research Funds for the Central Universities(No.300102341101)State Key Laboratory of Rail Transit Engineering Informatization(No.211934210083)。
文摘In this paper,we investigate dual problems for nonconvex set-valued vector optimization via abstract subdifferential.We first introduce a generalized augmented Lagrangian function induced by a coupling vector-valued function for set-valued vector optimization problem and construct related set-valued dual map and dual optimization problem on the basic of weak efficiency,which used by the concepts of supremum and infimum of a set.We then establish the weak and strong duality results under this augmented Lagrangian and present sufficient conditions for exact penalization via an abstract subdifferential of the object map.Finally,we define the sub-optimal path related to the dual problem and show that every cluster point of this sub-optimal path is a primal optimal solution of the object optimization problem.In addition,we consider a generalized vector variational inequality as an application of abstract subdifferential.
基金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.
