Skip to content

Johannes Jahn, Vectorization in nonconvex set optimization

Full Text: PDF
DOI: 10.23952/jano.4.2022.1.03
Volume 4, Issue 1, 1 April 2022, Pages 19-36 


Abstract. A new vectorization approach is presented for nonconvex set optimization problems with the set less order relation. This technique uses certain approximation problems with suitable parametric norms. The convexity of the sets is not required but one needs a strict lower and upper bound for all occuring sets. Karush-Kuhn-Tucker conditions are derived as necessary optimality conditions for set optimization problems in finite dimensional Euclidean spaces with the natural order cone. A multiplier-free necessary optimality condition is given as well.


How to Cite this Article:
Johannes Jahn, Vectorization in nonconvex set optimization, J. Appl. Numer. Optim. 4 (2022), 19-36.