2003
DOI: 10.1090/mmono/222
|View full text |Cite
|
Sign up to set email alerts
|

Convex Analysis: Theory and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0
3

Year Published

2006
2006
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 62 publications
(31 citation statements)
references
References 0 publications
0
28
0
3
Order By: Relevance
“…(c) If there is a point A i ∈ {A 1 , A 2 , A 3 , A 4 } satisfying G. G. Magaril-ll'yaev and V. M. Tikhomirov note that no construction of the weighted Fermat-Torricelli point with ruler and compass is known for a simplex with n + 1 vertices in R n [6,Subsection 8.4,p. 96].…”
Section: )mentioning
confidence: 99%
“…(c) If there is a point A i ∈ {A 1 , A 2 , A 3 , A 4 } satisfying G. G. Magaril-ll'yaev and V. M. Tikhomirov note that no construction of the weighted Fermat-Torricelli point with ruler and compass is known for a simplex with n + 1 vertices in R n [6,Subsection 8.4,p. 96].…”
Section: )mentioning
confidence: 99%
“…is the convex closure [30] of the output entropy H ( (ρ)) 3 . The functionĤ (ρ) is a natural generalization of another important quantity in quantum information theory, namely the "entanglement of formation" [6] and reduces to it when the channel is a partial trace.…”
Section: A Hierarchy Of the Additivity Conjecturesmentioning
confidence: 99%
“…15 Thus, in everything that follows we consider only solutions to the reduced contract-design problem that satisfy ∆(x) = 0 without having to impose this condition as an extra constraint in the search for a 15 Note that δ = −∆(x) satisfies (13) as a direct consequence of (12).…”
Section: The Reduced Contract-design Problemmentioning
confidence: 99%