2016
DOI: 10.1007/s10711-016-0147-3
|View full text |Cite
|
Sign up to set email alerts
|

Prescription of Gauss curvature using optimal mass transport

Abstract: Abstract. In this paper we give a new proof of a theorem by Alexandrov on the Gauss curvature prescription of Euclidean convex sets. This proof is based on the duality theory of convex sets and on optimal mass transport. A noteworthy property of this proof is that it does not rely neither on the theory of convex polyhedra nor on P.D.E. methods (which appeared in all the previous proofs of this result).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(33 citation statements)
references
References 17 publications
0
33
0
Order By: Relevance
“…We refer to [14,12] and the references therein for more on this topic. Notice that, from the mathematical point of view, a quite interesting feature of this cost function is that it is strictly convex and bounded on its domain, hence in particular it is not continuous on R n × R n (while the non real-valued cost functions have been often considered as continuous, see for instance [23,22,29,30,33,11]).…”
Section: Introductionmentioning
confidence: 99%
“…We refer to [14,12] and the references therein for more on this topic. Notice that, from the mathematical point of view, a quite interesting feature of this cost function is that it is strictly convex and bounded on its domain, hence in particular it is not continuous on R n × R n (while the non real-valued cost functions have been often considered as continuous, see for instance [23,22,29,30,33,11]).…”
Section: Introductionmentioning
confidence: 99%
“…Proof. We show only the direct implication, the reverse implication can be found in [3]. By assumption h = h K , where K is a bounded convex set that contains the origin in its interior, and let ρ K be the radial function of K i.e.…”
Section: Generalization To Convexity-like Constraintsmentioning
confidence: 93%
“…Remark 4.1 (Number of constraints). In numerical applications, we set ε = cδ, where c is a small constant, usually in the range (1,3]. For a fixed convex domain X of R 2 , there are O(1/ε) constraints per discrete segment and O(1/ε 2 ) such discrete segments.…”
Section: Numerical Implementationmentioning
confidence: 99%
“…He also proved well-posedness of the dual problem and the absence of the duality gap. His result was generalized later by J. Bertrand in [4]. In particularly, Bertrand constructed a transportational solution for a couple of probability measures µ = f · σ, ν under the generalized Alexandrov-type assumption:…”
Section: )mentioning
confidence: 99%