2001
DOI: 10.1007/978-3-642-56468-0
|View full text |Cite
|
Sign up to set email alerts
|

Fundamentals of Convex Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
652
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 975 publications
(653 citation statements)
references
References 0 publications
1
652
0
Order By: Relevance
“…For more details on definitions from convex analysis, we refer the reader to [15]. For a positive integer n, we let [n] be the set {1, .…”
Section: Definitions Main Results and Proof Ideamentioning
confidence: 99%
“…For more details on definitions from convex analysis, we refer the reader to [15]. For a positive integer n, we let [n] be the set {1, .…”
Section: Definitions Main Results and Proof Ideamentioning
confidence: 99%
“…This follows from the Slater property ρ(0) = 0 (see, e.g., [17,Prop. D.1.3.3]); it can also be checked directly:…”
Section: Cut-generating Functions As Representationsmentioning
confidence: 99%
“…For this, we use basic tools from convex analysis and geometry. Readers not familiar with this field may use [17] (especially its Chap. C) for an elementary introduction, while [16,22] are more complete.…”
Section: Introducing Cut-generating Functionsmentioning
confidence: 99%
“…The proof of a more general result can be found in [14] (Chapter E, Proposition 1.3.9(ii)). Denote by q t the strategy, constructed in Theorem 3, where F is replaced by F. We claim that F( q t ) = F( q t ), a.e.…”
Section: Cooperative Harvesting Problem: the Case Of Non-concave Revementioning
confidence: 99%