output
20102022
most citedAn Algorithm to Solve Polyhedral Convex Set Optimization Problems

23 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2014Show all

2 papers · 1 filter

math.OC2014★ 3 cited

Variational inequalities characterizing weak minimality in set optimization

Giovanni P. Crespi, MatteoRocca, Carola Schrage

We introduce the notion of weak minimizer in set optimization. Necessary and sufficient conditions in terms of scalarized variational inequalities of Stampacchia and Minty type, re…

math.OC2014★ 7 cited

A Minty variational principle for set optimization

Giovanni P. Crespi, Andreas H. Hamel, Carola Schrage

Extremal problems are studied involving an objective function with values in (order) complete lattices of sets generated by so called set relations. Contrary to the popular paradig…