Optimality Conditions for Minimax Optimization Problems with an Infinite Number of Constraints and Related Applications

被引:3
|
作者
Zhong, Li-nan [1 ]
Jin, Yuan-feng [1 ]
机构
[1] Yanbian Univ, Coll Sci, Dept Math, Yanji 133002, Peoples R China
来源
基金
中国国家自然科学基金;
关键词
minimax programming problem; semi-infinite optimization; limiting subdifferential; multiobjective optimization; approximate solutions; DUALITY; QUALIFICATIONS;
D O I
10.1007/s10255-021-1019-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper is concerned with the study of optimality conditions for minimax optimization problems with an infinite number of constraints, denoted by (MMOP). More precisely, we first establish necessary conditions for optimal solutions to the problem (MMOP) by means of employing some advanced tools of variational analysis and generalized differentiation. Then, sufficient conditions for the existence of such solutions to the problem (MMOP) are investigated with the help of generalized convexity functions defined in terms of the limiting subdifferential of locally Lipschitz functions. Finally, some of the obtained results are applied to formulating optimality conditions for weakly efficient solutions to a related multiobjective optimization problem with an infinite number of constraints, and a necessary optimality condition for a quasi epsilon-solution to problem (MMOP).
引用
下载
收藏
页码:251 / 263
页数:13
相关论文
共 50 条