Results 1  10
of
1,144
The geometry of optimal transportation
 Acta Math
, 1996
"... A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map i ..."
Abstract

Cited by 245 (33 self)
 Add to MetaCart
A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map is unique: it is characterized by the formula y(x) =x−(∇h) −1 (∇ψ(x)) and geometrical restrictions on ψ. Connections with mathematical economics, numerical computations, and the MongeAmpère equation are sketched. ∗ Both authors gratefully acknowledge the support provided by postdoctoral fellowships: WG at
The BrunnMinkowski inequality
 Bull. Amer. Math. Soc. (N.S
, 2002
"... Abstract. In 1978, Osserman [124] wrote an extensive survey on the isoperimetric inequality. The BrunnMinkowski inequality can be proved in a page, yet quickly yields the classical isoperimetric inequality for important classes of subsets of R n, and deserves to be better known. This guide explains ..."
Abstract

Cited by 184 (9 self)
 Add to MetaCart
Abstract. In 1978, Osserman [124] wrote an extensive survey on the isoperimetric inequality. The BrunnMinkowski inequality can be proved in a page, yet quickly yields the classical isoperimetric inequality for important classes of subsets of R n, and deserves to be better known. This guide explains the relationship between the BrunnMinkowski inequality and other inequalities in geometry and analysis, and some applications. 1.
An Elementary Introduction to Modern Convex Geometry
 in Flavors of Geometry
, 1997
"... Introduction to Modern Convex Geometry KEITH BALL Contents Preface 1 Lecture 1. Basic Notions 2 Lecture 2. Spherical Sections of the Cube 8 Lecture 3. Fritz John's Theorem 13 Lecture 4. Volume Ratios and Spherical Sections of the Octahedron 19 Lecture 5. The BrunnMinkowski Inequality and It ..."
Abstract

Cited by 171 (3 self)
 Add to MetaCart
(Show Context)
Introduction to Modern Convex Geometry KEITH BALL Contents Preface 1 Lecture 1. Basic Notions 2 Lecture 2. Spherical Sections of the Cube 8 Lecture 3. Fritz John's Theorem 13 Lecture 4. Volume Ratios and Spherical Sections of the Octahedron 19 Lecture 5. The BrunnMinkowski Inequality and Its Extensions 25 Lecture 6. Convolutions and Volume Ratios: The Reverse Isoperimetric Problem 32 Lecture 7. The Central Limit Theorem and Large Deviation Inequalities 37 Lecture 8. Concentration of Measure in Geometry 41 Lecture 9. Dvoretzky's Theorem 47 Acknowledgements 53 References 53 Index 55 Preface These notes are based, somewhat loosely, on three series of lectures given by myself, J. Lindenstrauss and G. Schechtman, during the Introductory Workshop in Convex Geometry held at the Mathematical Sciences Research Institute in Berkeley, early in 1996. A fourth series was given by B. Bollobas, on rapid mixing and random volume algorithms; they are found els
Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity
 SIAM Journal on Optimization
, 2006
"... Abstract. Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of supports for sums of ..."
Abstract

Cited by 119 (29 self)
 Add to MetaCart
(Show Context)
Abstract. Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of supports for sums of squares (SOS) polynomials that lead to efficient SOS and semidefinite programming (SDP) relaxations are obtained. Numerical results from various test problems are included to show the improved performance of the SOS and SDP relaxations. Key words.
A masstransportation approach to sharp Sobolev and GagliardoNirenberg inequalities
 MATH
, 2004
"... We show that mass transportation methods provide an elementary and powerful approach to the study of certain functional inequalities with a geometric content, like sharp Sobolev or GagliardoNirenberg inequalities. The Euclidean structure of Rn plays no role in our approach: we establish these inequ ..."
Abstract

Cited by 111 (2 self)
 Add to MetaCart
(Show Context)
We show that mass transportation methods provide an elementary and powerful approach to the study of certain functional inequalities with a geometric content, like sharp Sobolev or GagliardoNirenberg inequalities. The Euclidean structure of Rn plays no role in our approach: we establish these inequalities, together with cases of equality, for an arbitrary norm.
A Riemannian interpolation inequality à la Borell, Brascamp and Lieb
, 2001
"... A concavity estimate is derived for interpolations between L¹(M) mass densities on a Riemannian manifold. The inequality sheds new light on the theorems of Prékopa, Leindler, Borell, Brascamp and Lieb that it generalizes from Euclidean space. Due to the curvature of the manifold, the new Riemannian ..."
Abstract

Cited by 87 (9 self)
 Add to MetaCart
A concavity estimate is derived for interpolations between L¹(M) mass densities on a Riemannian manifold. The inequality sheds new light on the theorems of Prékopa, Leindler, Borell, Brascamp and Lieb that it generalizes from Euclidean space. Due to the curvature of the manifold, the new Riemannian versions of these theorems incorporate a volume distortion factor which can, however, be controlled via lower bounds on Ricci curvature. The method uses optimal mappings from mass transportation theory. Along the way, several new properties are established for optimal mass transport and interpolating maps on a Riemannian manifold.
How many zeros of a random polynomial are real
 Bull. Amer. Math. Soc. (N.S
, 1995
"... Abstract. We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real zeros is simply the length of the moment curve (1, t, ..."
Abstract

Cited by 81 (0 self)
 Add to MetaCart
Abstract. We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real zeros is simply the length of the moment curve (1, t,..., t n) projected onto the surface of the unit sphere, divided by π. The probability density of the real zeros is proportional to how fast this curve is traced out. We then relax Kac’s assumptions by considering a variety of random sums, series, and distributions, and we also illustrate such ideas as integral geometry and the FubiniStudy metric. Contents 1.