Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials

JOURNAL OF GLOBAL OPTIMIZATION(2022)

引用 5|浏览19
暂无评分
摘要
In this paper, we give some characterizations of the robust optimal solution set for nonconvex uncertain semi-infinite programming problems in terms of tangential subdifferentials. By using a new robust-type constraint qualification, we first obtain some necessary and sufficient optimality conditions of the robust optimal solution for the nonconvex uncertain semi-infinite programming problem via the robust optimization approach. Then, by using the Dini pseudoconvexity, we obtain some characterizations of the robust optimal solution set for the nonconvex uncertain semi-infinite programming problem. Finally, as applications of our results, we derive some optimality conditions of the robust optimal solution and characterizations of the robust optimal solution set for the cone-constrained nonconvex uncertain optimization problem. Some examples are given to illustrate the advantage of the results.
更多
查看译文
关键词
Nonconvex uncertain semi-infinite programming,Tangential subdifferential,Robust optimal solution set,Dini pseudoconvexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要