2015
DOI: 10.1007/978-3-662-48670-2_3
|View full text |Cite
|
Sign up to set email alerts
|

Set Optimization—A Rather Short Introduction

Abstract: Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for setand vector-valued functions, and duality for set optimization problems. Extensive sections with bibliographical comments summarize the state of the art. Applications to vector optimization and financial risk measures are discussed along with algorithmic approaches to set optimization problems.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
83
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 71 publications
(83 citation statements)
references
References 190 publications
(265 reference statements)
0
83
0
Order By: Relevance
“…For another solution notion, we refer the reader to [3], where solution denotes a special set consisting of solutions in the sense of Definition 2.4 w.r.t. the l-less order relation.…”
Section: Definition 24mentioning
confidence: 99%
See 1 more Smart Citation
“…For another solution notion, we refer the reader to [3], where solution denotes a special set consisting of solutions in the sense of Definition 2.4 w.r.t. the l-less order relation.…”
Section: Definition 24mentioning
confidence: 99%
“…Therefore, only one element may decide about optimality of the whole set [2]. In the lattice approach, conlinear spaces are considered which carry the structure of a complete lattice [3]. In this paper, we use the so-called set approach and exploit one of the well-known set relations [2,4]-the set less order relation (cf.…”
Section: Introductionmentioning
confidence: 99%
“…In this generality, the preorder l was probably discussed for the first time by Hamel in [9, (2.6)], at least in the context of variational analysis/optimization. However, there are many precursors: the interested reader is referred to [10] for a more thorough survey and detailed references.…”
Section: The Brezis-browder Principlementioning
confidence: 99%
“…For this paper, the main results simplify when using the dual representation w.r.t. the positive convex conjugate introduced in [36]. This dual representation will be deduced below.…”
Section: Dual Representationmentioning
confidence: 99%
“…Proof of Theorem 2.9. Recall from [36,Remark 5.5] that the conjugate and negative conjugate are related via β t (Q, w) = G M t (w)− . (−β t (Q, w)) and −β t (Q, w) = G M t (w)− .…”
Section: B2 Proof Of Theorem 29mentioning
confidence: 99%