<p>Durea and Florea introduced the notion of cone sequential compactness of a set (J. Optim. Theory Appl. (2024) 200:1286-1308). In this paper, we give some characterizations of cone sequential compactness and establish some results by virtue of cone sequential compactness, for instance, Weierstrass-type theorem, separation theorem of convex sets and an equivalent characterization for cone upper semicontinuity of set-valued mappings. Moreover, we obtain some properties of a nonlinear scalarizing function by employing cone sequential compactness. As an application, we establish connectedness and arcwise connectedness of the solution sets for set optimization problems by utilizing cone sequential compactness.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Cone Sequential Compactness of a Set and an Application to Set Optimization Problems

  • Yu Han

摘要

Durea and Florea introduced the notion of cone sequential compactness of a set (J. Optim. Theory Appl. (2024) 200:1286-1308). In this paper, we give some characterizations of cone sequential compactness and establish some results by virtue of cone sequential compactness, for instance, Weierstrass-type theorem, separation theorem of convex sets and an equivalent characterization for cone upper semicontinuity of set-valued mappings. Moreover, we obtain some properties of a nonlinear scalarizing function by employing cone sequential compactness. As an application, we establish connectedness and arcwise connectedness of the solution sets for set optimization problems by utilizing cone sequential compactness.