Cone sequential compactness of a set and an application to set optimization problems (Q6952230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8070497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cone sequential compactness of a set and an application to set optimization problems |
scientific article; zbMATH DE number 8070497 |
Statements
Cone sequential compactness of a set and an application to set optimization problems (English)
0 references
28 July 2025
0 references
\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.
0 references
cone sequential compactness
0 references
nonlinear scalarizing function
0 references
set optimization problem
0 references
connectedness
0 references
0 references
0 references
0 references
0 references