Scalarization, convergence and well-posedness in set optimization
Taiyong Li & Manli Yang
What the paper says
In this paper, we introduce the notions of weak $ m $-minimal approximate solutions and $ m $-minimal approximate solutions for constrained set optimization problems, based on a novel set order relation that involves the Minkowski difference. We derive scalarization results for the sets of weak $ m $-minimal approximate solutions and $ m $-minimal approximate solutions in the context of set optimization. Utilizing these scalarizations, we analyze the Painlevé-Kuratowski convergence properties of both classes of approximate solutions. Furthermore, new notions of well-posedness for set optimization problems are proposed, and relationships between these notions are rigorously established. Finally, we establish equivalences between the well-posedness of set optimization problems and their scalar counterparts through carefully constructed optimization frameworks.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.