scientific article; zbMATH DE number 1149836
Based on series of lectures given at the Introductory Workshop in Convex Geometry (Mathematical Sciences Research Institute, Berkeley 1996), the author wrote a nice article presenting a collection of central topics from convex geometry, and instead of giving a comprehensive description of the state of the art in each case, he describes the main ideas necessary for a modern view of convex geometry. The style of his writing makes these ideas accessible to a broad audience. The topics discussed are: spherical sections of the cube (approximation of the Euclidean ball by centrally symmetric polytopes), John's ellipsoid, volume ratios and spherical sections of the \(n\)-dimensional cross polytope \(B^n_1\) (e.g., approximating the ball by \(B^n_1 \cap UB^n_1\), where \(U\) is an orthogonal transformation), the Brunn-Minkowski inequality and its extensions, the reverse isoperimetric problem (successfully investigated by the author himself), the central limit theorem and large deviation inequalities (including Bernstein's inequality, also called Hoeffding's inequality by probabilists), concentration of measure in geometry (geometric analogues of Bernstein's deviation inequality which are closely related to approximate isoperimetric inequalities), and Dvoretzky's theorem (understood as a generic term for statements related to the effect that high-dimensional bodies have almost ellipsoidal slices). In a convenient and compressed manner the reader is led to understand the main developments and central results close to the topics described above. By a lot of nice figures the author shows the geometric nature of many discussed problems, strongly facilitating the reader's approach. For the entire collection see [Zbl 0882.00019].
- The symmetric property \((\tau )\) for the Gaussian measure
- A direct proof of the functional Santaló inequality
- Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises
- The weighted Fourier inequality, polarity, and reverse Hölder inequality
- A guideline to study the feasibility domain of multi-trophic and changing ecological communities
- Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach
- Extended formulations in mixed integer conic quadratic programming
- Image labeling by assignment
- Polytopal approximation of elongated convex bodies
- Extremal problems related to Gauss-John position
- Flat forms in Banach spaces
- Stability of the Blaschke-Santaló and the affine isoperimetric inequality
- Universal gaps for XOR games from estimates on tensor norm ratios
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- On the approximation of convex bodies by ellipses with respect to the symmetric difference metric
- Inscribed and circumscribed ellipsoidal cones: volume ratio analysis
- New estimates for convex layer numbers
- Symmetrized Birkhoff-James orthogonality in arbitrary normed spaces
- Quantitative combinatorial geometry for concave functions
- From affine Poincaré inequalities to affine spectral inequalities
- Analyzing differentiable fuzzy logic operators
- Best approximation of functions by log-polynomials
- Some implications of interval approach to dimension for network complexity
- The norm of linear extension operators for \(C^{m-1,1}(\mathbb{R}^n)\)
- Large equilateral sets in subspaces of _^n of small codimension
- Functional John ellipsoids
- Intervention with limited information
- Around the Danzer problem and the construction of dense forests
- Irreversibility from staircases in symplectic embeddings
- On the width of transitive sets: bounds on matrix coefficients of finite groups
- Towards understanding sparse filtering: a theoretical perspective
- On the volume of unit balls of finite-dimensional Lorentz spaces
- Bracketing numbers of convex and m-monotone functions on polytopes
- Lower bounds for finding stationary points I
- One-trial correction of legacy AI systems and stochastic separation theorems
- Fast construction of correcting ensembles for legacy artificial intelligence systems: algorithms and a case study
- Colorful Helly-type theorems for the volume of intersections of convex bodies
- Quantitative fractional Helly and \((p,q)\)-theorems
- Functional Löwner ellipsoids
- On the asymptotics of the principal moments of inertia of a convex body in the isotropic state
- An extension of a theorem of Yao and Yao
- On graph parameters guaranteeing fast sandpile diffusion
- On the upper bound for the expectation of the norm of a vector uniformly distributed on the sphere and the phenomenon of concentration of uniform measure on the sphere
- Approximation with random bases: pro et contra
- Stochastic separation theorems
- Relaxing high-dimensional constraints in the direct solution space method for early phase development
- On the sample-mean method for computing hyper-volumes
- An extension of Minkowski's theorem and its applications to questions about projections for measures
- Extremal norms for fiber-bunched cocycles
- Streaming algorithms for extent problems in high dimensions
- On the stability of Brunn-Minkowski type inequalities
- The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
- On the vertex index of convex bodies
- Min-up/min-down polytopes
- Many empty triangles have a common edge
- Energy and area minimizers in metric spaces
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- Prékopa-Leindler type inequalities on Riemannian manifolds, Jacobi fields, and optimal transport
- On the symmetry function of a convex set
- An upper bound for permanents of nonnegative matrices
- On a question of A. Koldobsky
- Randomized interior point methods for sampling and optimization
- Restricted risk measures and robust optimization
- On the Carathéodory number for strong convexity
- On a posteriori error estimation using distances between numerical solutions and angles between truncation errors
- On Hölder-continuity of Oseledets subspaces
- Estimation in high dimensions: a geometric perspective
- Mixed integer linear programming formulation techniques
- Evolvability of real functions
- Blaschke-Santaló and Mahler inequalities for the first eigenvalue of the Dirichlet Laplacian
- Multidimensional geometry, functions of very many variables, and probability
- Tauberian conditions, Muckenhoupt weights, and differentiation properties of weighted bases
- Entropies from coarse-graining: convex polytopes vs. ellipsoids
- Metric and classical fidelity uncertainty relations for random unitary matrices
- Helly-type theorems for the diameter
- Ball, sphere, and all, all, all
- Extremal convex bodies for affine measures of symmetry
- The john theorem for simplex
- Two geometric interpretations of the multidimensional Hardy uncertainty principle
- Sampling Hypersurfaces through Diffusion
- A multivariate Gnedenko law of large numbers
- Mean width inequalities for isotropic measures
- The floating body and the hyperplane conjecture
- Statistical hyperbolicity in groups.
- A geometric algorithm for winding number computation with complexity analysis
- Accuracy of approximations of solutions to Fredholm equations by kernel methods
- scientific article; zbMATH DE number 1098745 (Why is no real title available?)
- About the centroid blody and the ellipsoid of inertia
- Approximate polytope membership queries
- Semidefinite Approximation of Closed Convex Set
- scientific article; zbMATH DE number 2149435 (Why is no real title available?)
- On approximation by projections of polytopes with few facets
- The complexity of some topological inference problems
- Diophantine approximation on Veech surfaces
- A flexible theoretical representation for the temporal dynamics of structured populations as paths on polytope complexes
- Concentration inequalities and geometry of convex bodies
- On the theory of policy gradient methods: optimality, approximation, and distribution shift
- One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
- A mélange of diameter Helly-type theorems
- Sample-based high-dimensional convexity testing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387224)
