10,048 research outputs found
Stability and separation in volume comparison problems
We review recent stability and separation results in volume comparison
problems and use them to prove several hyper- plane inequalities for
intersection and projection bodies.Comment: arXiv admin note: text overlap with arXiv:1101.3600, arXiv:1204.253
Non-uniqueness of convex bodies with prescribed volumes of sections and projections
We show that if is even, then one can find two essentially different
convex bodies such that the volumes of their maximal sections, central
sections, and projections coincide for all directions
Integer cells in convex sets
Every convex body K in R^n has a coordinate projection PK that contains at
least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at
least one. Our proof of this counterpart of Minkowski's theorem is based on an
extension of the combinatorial density theorem of Sauer, Shelah and
Vapnik-Chervonenkis to Z^n. This leads to a new approach to sections of convex
bodies. In particular, fundamental results of the asymptotic convex geometry
such as the Volume Ratio Theorem and Milman's duality of the diameters admit
natural versions for coordinate sections.Comment: Historical remarks on the notion of the combinatorial dimension are
added. This is a published version in Advances in Mathematic
Handling convexity-like constraints in variational problems
We provide a general framework to construct finite dimensional approximations
of the space of convex functions, which also applies to the space of c-convex
functions and to the space of support functions of convex bodies. We give
estimates of the distance between the approximation space and the admissible
set. This framework applies to the approximation of convex functions by
piecewise linear functions on a mesh of the domain and by other
finite-dimensional spaces such as tensor-product splines. We show how these
discretizations are well suited for the numerical solution of problems of
calculus of variations under convexity constraints. Our implementation relies
on proximal algorithms, and can be easily parallelized, thus making it
applicable to large scale problems in dimension two and three. We illustrate
the versatility and the efficiency of our approach on the numerical solution of
three problems in calculus of variation : 3D denoising, the principal agent
problem, and optimization within the class of convex bodies.Comment: 23 page
- …