Cone sequential compactness of a set and an application to set optimization problems

From MaRDI portal





\textit{M. Durea} and \textit{E.-A. Florea} introduced the notion of cone sequential compactness of a set [J. Optim. Theory Appl. 200, No. 3, 1286--1308 (2024; Zbl 1566.49019)]. In this paper, the authors provide characterizations of cone sequential compactness and establish several results based on this notion -- for instance, a Weierstrass-type theorem, a separation theorem for convex sets, and an equivalent characterization of cone upper semicontinuity for set-valued mappings. Moreover, they derive properties of a nonlinear scalarizing function by employing cone sequential compactness. As an application, they establish the connectedness and arcwise connectedness of the solution sets to set optimization problems using cone sequential compactness.



Cites work









This page was built for publication: Cone sequential compactness of a set and an application to set optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952230)