arXiv Analytics

Sign in

arXiv:2311.15185 [math.OC]AbstractReferencesReviewsResources

Contractibility of the solution sets for set optimization problems

Bin Chen, Yu Han

Published 2023-11-26Version 1

This paper aims at investigating the contractibility of the solution sets for set optimization problems by utilizing strictly quasi cone-convexlikeness, which is an assumption weaker than strictly cone-convexity, strictly cone-quasiconvexity and strictly naturally quasi cone-convexity. We establish the contractibility of l-minimal, l-weak minimal, u-minimal and u-weak minimal solution sets for set optimization problems by using the star-shape sets and the nonlinear scalarizing functions for sets. Moreover, we also discuss the arcwise connectedness and the contractibility of p-minimal and p-weak minimal solution sets for set optimization problems by using the scalarization technique. Finally, our main results are applied to the contractibility of the solution sets for vector optimization problems.

Related articles: Most relevant | Search more
arXiv:2311.15644 [math.OC] (Published 2023-11-27)
Subdifferential calculus and ideal solutions for set optimization problems
arXiv:2501.04711 [math.OC] (Published 2024-12-29)
Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
arXiv:2407.13245 [math.OC] (Published 2024-07-18)
Descent Methods for Vector Optimization Problems: A Majorization-Minimization Perspective