On the monotonicity of the expected volume of a random. Luis Rademacher Computer Science and Engineering The Ohio State University
|
|
- Dustin Esmond Ferguson
- 5 years ago
- Views:
Transcription
1 On the monotonicity of the expected volume of a random simplex Luis Rademacher Computer Science and Engineering The Ohio State University
2 Sylvester s problem 4 random points: what is the probability that they are in convex position? P : convex hull of n random points in convex n K body K. Which convex bodies K are extremal for EvolP K n volk
3 Questions by Meckes and Reitzner K M = EvolP K n cd EvolP M n M s weak conjecture: for n=d+1 (random simplex) there exists some c. M s strong conjecture: for n=d+1 and c=1 R s question: for arbitrary n and c=1.
4 Connectionwith slicing Slicing conjecture: every d-dimensional convex body of volume one has a hyperplane section of area >=c for some universal c. Equivalent: for K a d-dimensional convex body L K :=(deta(k)/(volk) 2 ) 1/2d hasauniversalupperbound. M s weak conjecture slicing M s weak conjecture: c>0suchthatforanypairk,m ofd-dimensionalconvexbodies K M = EvolP K d+1 c d EvolP M d+1
5 Main result About M s strong conjecture: True in dimension 1,2 False in dimension >=4 Strong numerical evidence for falsity in dim. 3. M s strong conjecture: ForanypairK,M ofd-dimensionalconvexbodies K M? = EvolP K d+1 EvolP M d+1
6 Busemann-Petty ( θ S d 1 )vol d 1 (K θ ) vol d 1 (L θ )? = volk cvoll Classical: when c=1, true iff dim<5 c slicing Similarity with our problem: Dimension-dependent answer, connection with slicing Difference with our problem: Ours has elementary solution, no Fourier analysis.
7 Questionby Vempala K M? = deta(k) c d deta(m) A(K) = covariance matrix of K Original question: for c=1.
8 c slicing: Questionby Vempala K M? = deta(k) c d deta(m) deta(k)/vol(k) 2 =L 2d K : easy from * and bounded isotropic constant : : 1. Let K,M be two convex bodies. Assumption with * imply L K c 1/2 d(k,m) L M : By affine invariance, w.l.o.g. K,M are in position such that K M d(k,m)k. Implies volm d(k,m) d volk. 2. Use Klartag s isomorphic slicing problem: given K,ε, there exists M s.t. d(k,m) 1+εand L M 1/ ǫ
9 Question by Vempala Connection with random simplexes: (µ(k)=centroid of K) ( deta(k)=d!e Xi K (volconvµ(k),x1,...,x d ) 2) = d! d+1 E( (volpd+1 K )2), I.e. second moment version of Meckes s question.
10 Second result We also solve Vempala s question for c=1 True in dimension 1,2 False in dimension >=3 Our solution to Vempala s question inspired our solution to Meckes s strong conjecture. Vempala s question(for c = 1): K L? = deta(k) deta(l)
11 Solutionto Vempala s question Intuition: extreme point near the centroid E (random simplexusing L\K) < E( using L)
12 Solution to Vempala s question Idea: Monotonicity of K adeta(k) holds for dimension difffor every K L there is a nonincreasing path of convex bodies from L to K. We will: define path, compute derivative along path, and study sign of derivative.
13 Solution to Vempala s question W.l.o.g. K is a polytope (by continuity, if there is a counterexample, then there is one where K is a polytope) Path : push hyperplanes parallel to facets of K in, one by one. L K
14 Solution to Vempala s question deta( ) continuous along path, piecewise continuously differentiable. Enough to compute derivative with respect intersection with moving halfspace. Enough to compute derivative in isotropic position (sign of derivative is invariant under affine transformations). K t =K {x:a T x t} d dt deta(k t)
15 Solution to Vempala s question Simple value of derivative in isotropic position: Proposition. Let K R d be an isotropic convex body. Let v R d be a unit vector. Let a=inf x K v x, b=sup x K v x. Let H t ={x R d :v x t}. LetK t =K H t,s t =K bdryh t. Then d dt deta(k t) = t=a ( d E X Sa X 2) vol d 1 S a volk.
16 Solution to Vempala s question Derivative implies dimension dependent condition: Lemma. Monotonicity under inclusion of K deta(k) holds for some dimensiondiffforanyisotropicconvex body K R d wehave dbd K. Proof: if part : condition implies negative derivative along path. d dt deta(k t) = t=a ( d E X Sa X 2) vol d 1 S a volk.
17 Proof (cont d) Only if part: There is an isotropic convex body L with a boundary point x at distance <d 1/2 from the origin. By an approximation argument can assume x is extreme point (keeping isotropy and distance condition) of new body L. Positive derivative as one pushes hyperplane in at x a little bit. If K is L truncated near x, deta(k) > deta(l).
18 When does the condition hold? Condition: for any isotropic convex body K dbd K. Milman-Pajor, Kannan-Lovász-Simonovits: For any isotropic convex body K: d+2 d B d K d(d+2)b d and this is best possible. I.e., condition fails iffd 3.
19 Solution to Meckes s strong conjecture Argument parallels case of det A(K): same path between K and L (push hyperplanes in), same derivative (i.e. with respect to moving hyperplane) Our derivative is a special case Crofton s differential equation: (from Kendall and Moran, Geometrical Probability, 1963)
20 Derivative Proposition (general derivative, Crofton). Let K R d be a convex body. Let v R d be a unit vector. Let a = inf x K v x, b = sup x K v x. Let H t = {x R d : v x t}. Let K t = K H t, S t = K bdryh t. Let f :(R d ) k Rbe asymmetriccontinuous function. Let X 1,...,X k berandom pointsink. Then d dt Ef(X ( 1,...,X k ) =k Ef(X 1,...,X k ) E ( ) ) vol d 1 S a f(x 1,...,X k ) X 1 S a t=a volk
21 Solution to Meckes s strong conjecture Dimension dependent condition (same proof): Lemma. Monotonicity under inclusion of K E Xi KvolconvX 0,...,X d holdsforsomedimensiondiffforanyconvexbodyk R d andanyx bdryk and X 0,...,X d randomink wehave EvolconvX 0,X 1,...,X d Evolconvx,X 1,...,X d.
22 When does the condition hold? Failsford 4: K=halfball,x=0,L=ballofsamevolumeasK. Ontheotherhand, EvolPd+1 EvolP K d+1 L (Blaschke-Groemer) = 1 ( ) d+1 κd+1 κ d(d+2) 1 (known) d! κ (d+1) 2ω d+1 κ d E K volconv(0,x 1,...,X d )=E Bd volconv(0,x 1,...,X d ) (symmety) = 1 ( ) d κd+1 2 (known) d! ω d+1 Combine to get κ d E K volconv(0,x 1,...,X d ) EvolP K d+1 2 d+2 d+1
23 When does the condition hold? true for d=1, easy (directly, without the condition)
24 When does the condition hold? Trueford=2: Theorem(Blaschke). Among all 2-dimensional convex bodies, E Xi K(volconv(X 0,X 1,X 2 )) vol(k) 1 12 withequalityiffk isatriangle. Lemma. LetK R 2 beaconvex body andletx bdryk. Then E X1,X 2 K(volconvx,X 1,X 2 ) volk 8 9π2. (1) Proof idea: Worst case, K is half ellipse, x its center. Then Steiner symmetrization, Blaschke s Schüttelung (shaking), symmetrization around x, Busemann s inequality.
25 When does the condition hold? d=3? The proof doesn t handle it, but numerical integration strongly suggests false (same counterexample).
26 Open questions Higher moments? (Reitzner) What about more than d+1 points? (technical) 3-D case Weak conjecture via Crofton s differential equation?
arxiv: v1 [math.mg] 27 Jan 2016
On the monotonicity of the moments of volumes of random simplices arxiv:67295v [mathmg] 27 Jan 26 Benjamin Reichenwallner and Matthias Reitzner University of Salzburg and University of Osnabrueck Abstract
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES
ON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES DAVID ALONSO-GUTIÉRREZ, JESÚS BASTERO, JULIO BERNUÉS, AND PAWE L WOLFF Abstract. The isotropy constant of any d-dimensional polytope with n vertices
More informationOptimization of a Convex Program with a Polynomial Perturbation
Optimization of a Convex Program with a Polynomial Perturbation Ravi Kannan Microsoft Research Bangalore Luis Rademacher College of Computing Georgia Institute of Technology Abstract We consider the problem
More informationAlgorithmic Convex Geometry
Algorithmic Convex Geometry August 2011 2 Contents 1 Overview 5 1.1 Learning by random sampling.................. 5 2 The Brunn-Minkowski Inequality 7 2.1 The inequality.......................... 8 2.1.1
More informationVolumes of projection bodies of some classes of convex bodies
Volumes of projection bodies of some classes of convex bodies Christos Saroglou University of Crete Department of Mathematics Abstract Schneider posed the problem of determining the maximal value of the
More informationA sharp Rogers Shephard type inequality for Orlicz-difference body of planar convex bodies
Proc. Indian Acad. Sci. (Math. Sci. Vol. 124, No. 4, November 2014, pp. 573 580. c Indian Academy of Sciences A sharp Rogers Shephard type inequality for Orlicz-difference body of planar convex bodies
More informationLearning convex bodies is hard
Learning convex bodies is hard Navin Goyal Microsoft Research India navingo@microsoft.com Luis Rademacher Georgia Tech lrademac@cc.gatech.edu Abstract We show that learning a convex body in R d, given
More informationApproximately Gaussian marginals and the hyperplane conjecture
Approximately Gaussian marginals and the hyperplane conjecture Tel-Aviv University Conference on Asymptotic Geometric Analysis, Euler Institute, St. Petersburg, July 2010 Lecture based on a joint work
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More informationSampling and high-dimensional convex geometry
Sampling and high-dimensional convex geometry Roman Vershynin SampTA 2013 Bremen, Germany, June 2013 Geometry of sampling problems Signals live in high dimensions; sampling is often random. Geometry in
More informationConvexity in R N Supplemental Notes 1
John Nachbar Washington University November 1, 2014 Convexity in R N Supplemental Notes 1 1 Introduction. These notes provide exact characterizations of support and separation in R N. The statement of
More informationOn isotropicity with respect to a measure
On isotropicity with respect to a measure Liran Rotem Abstract A body is said to be isoptropic with respect to a measure µ if the function θ x, θ dµ(x) is constant on the unit sphere. In this note, we
More informationConvex inequalities, isoperimetry and spectral gap III
Convex inequalities, isoperimetry and spectral gap III Jesús Bastero (Universidad de Zaragoza) CIDAMA Antequera, September 11, 2014 Part III. K-L-S spectral gap conjecture KLS estimate, through Milman's
More informationMahler Conjecture and Reverse Santalo
Mini-Courses Radoslaw Adamczak Random matrices with independent log-concave rows/columns. I will present some recent results concerning geometric properties of random matrices with independent rows/columns
More informationDispersion of Mass and the Complexity of Geometric Problems. Luis Alexis Rademacher
Dispersion of Mass and the Complexity of Geometric Problems by Luis Alexis Rademacher Licenciado en Ciencias de la Ingeniería Universidad de Chile 2002) Ingeniero Civil Matemático Universidad de Chile
More informationMinkowski Valuations
Minkowski Valuations Monika Ludwig Abstract Centroid and difference bodies define SL(n) equivariant operators on convex bodies and these operators are valuations with respect to Minkowski addition. We
More informationOn the distribution of the ψ 2 -norm of linear functionals on isotropic convex bodies
On the distribution of the ψ 2 -norm of linear functionals on isotropic convex bodies Joint work with G. Paouris and P. Valettas Cortona 2011 June 16, 2011 (Cortona 2011) Distribution of the ψ 2 -norm
More informationThe centroid body: algorithms and statistical estimation for heavy-tailed distributions
The centroid body: algorithms and statistical estimation for heavy-tailed distributions Luis Rademacher Athens GA, March 2016 Joint work with Joseph Anderson, Navin Goyal and Anupama Nandi Challenge. Covariance
More information1 Maximal Lattice-free Convex Sets
47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove
More informationEstimates for the affine and dual affine quermassintegrals of convex bodies
Estimates for the affine and dual affine quermassintegrals of convex bodies Nikos Dafnis and Grigoris Paouris Abstract We provide estimates for suitable normalizations of the affine and dual affine quermassintegrals
More informationHyperplane sections of convex bodies
Hyperplane sections of convex bodies Carla Peri Università Cattolica S.C. - Milano Fourth International Workshop on Convex Geometry - Analytic Aspects Cortona, June 4th - 8th, 2007 K R n convex body K
More informationHigh-dimensional distributions with convexity properties
High-dimensional distributions with convexity properties Bo az Klartag Tel-Aviv University A conference in honor of Charles Fefferman, Princeton, May 2009 High-Dimensional Distributions We are concerned
More informationGAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. 2π) n
GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. A. ZVAVITCH Abstract. In this paper we give a solution for the Gaussian version of the Busemann-Petty problem with additional
More informationLecture 2: Convex functions
Lecture 2: Convex functions f : R n R is convex if dom f is convex and for all x, y dom f, θ [0, 1] f is concave if f is convex f(θx + (1 θ)y) θf(x) + (1 θ)f(y) x x convex concave neither x examples (on
More informationFall, 2003 CIS 610. Advanced geometric methods. Homework 3. November 11, 2003; Due November 25, beginning of class
Fall, 2003 CIS 610 Advanced geometric methods Homework 3 November 11, 2003; Due November 25, beginning of class You may work in groups of 2 or 3 Please, write up your solutions as clearly and concisely
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More informationStar bodies with completely symmetric sections
Star bodies with completely symmetric sections Sergii Myroshnychenko, Dmitry Ryabogin, and Christos Saroglou Abstract We say that a star body is completely symmetric if it has centroid at the origin and
More informationALEXANDER KOLDOBSKY AND ALAIN PAJOR. Abstract. We prove that there exists an absolute constant C so that µ(k) C p max. ξ S n 1 µ(k ξ ) K 1/n
A REMARK ON MEASURES OF SECTIONS OF L p -BALLS arxiv:1601.02441v1 [math.mg] 11 Jan 2016 ALEXANDER KOLDOBSKY AND ALAIN PAJOR Abstract. We prove that there exists an absolute constant C so that µ(k) C p
More informationGaussian Measure of Sections of convex bodies
Gaussian Measure of Sections of convex bodies A. Zvavitch Department of Mathematics, University of Missouri, Columbia, MO 652, USA Abstract In this paper we study properties of sections of convex bodies
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationRapid Steiner symmetrization of most of a convex body and the slicing problem
Rapid Steiner symmetrization of most of a convex body and the slicing problem B. Klartag, V. Milman School of Mathematical Sciences Tel Aviv University Tel Aviv 69978, Israel Abstract For an arbitrary
More informationOn the cells in a stationary Poisson hyperplane mosaic
On the cells in a stationary Poisson hyperplane mosaic Matthias Reitzner and Rolf Schneider Abstract Let X be the mosaic generated by a stationary Poisson hyperplane process X in R d. Under some mild conditions
More informationRandom hyperplane tessellations and dimension reduction
Random hyperplane tessellations and dimension reduction Roman Vershynin University of Michigan, Department of Mathematics Phenomena in high dimensions in geometric analysis, random matrices and computational
More informationIsomorphic Steiner symmetrization of p-convex sets
Isomorphic Steiner symmetrization of p-convex sets Alexander Segal Tel-Aviv University St. Petersburg, June 2013 Alexander Segal Isomorphic Steiner symmetrization 1 / 20 Notation K will denote the volume
More informationMINKOWSKI AREAS AND VALUATIONS. Monika Ludwig. Abstract
MINKOWSKI AREAS AND VALUATIONS Monika Ludwig Abstract All continuous GL(n) covariant valuations that map convex bodies to convex bodies are completely classified. This establishes a characterization of
More informationTHE STEINER FORMULA FOR EROSIONS. then one shows in integral geometry that the volume of A ρk (ρ 0) is a polynomial of degree n:
THE STEINER FORMULA FOR EROSIONS. G. MATHERON Abstract. If A and K are compact convex sets in R n, a Steiner-type formula is valid for the erosion of A by K if and only if A is open with respect to K.
More informationTopics in Stochastic Geometry. Lecture 4 The Boolean model
Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 4 The Boolean model Lectures presented at the Department of Mathematical Sciences University of Bath May
More informationGeometric Incidences and related problems. Shakhar Smorodinsky. (Ben-Gurion University)
Geometric Incidences and related problems Shakhar Smorodinsky (Ben-Gurion University) Note: good & bad news Good news: Last Talk Bad news: Pick your favorite one. The K-set problem (Definition) S = n pts
More information1 Lesson 1: Brunn Minkowski Inequality
1 Lesson 1: Brunn Minkowski Inequality A set A R n is called convex if (1 λ)x + λy A for any x, y A and any λ [0, 1]. The Minkowski sum of two sets A, B R n is defined by A + B := {a + b : a A, b B}. One
More informationConvex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12.
Applications of the Brascamp-Lieb and Barthe inequalities Exercise 12.1 Show that if m Ker M i {0} then both BL-I) and B-I) hold trivially. Exercise 12.2 Let λ 0, 1) and let f, g, h : R 0 R 0 be measurable
More informationProbabilistic Methods in Asymptotic Geometric Analysis.
Probabilistic Methods in Asymptotic Geometric Analysis. C. Hugo Jiménez PUC-RIO, Brazil September 21st, 2016. Colmea. RJ 1 Origin 2 Normed Spaces 3 Distribution of volume of high dimensional convex bodies
More informationAsymptotic shape of a random polytope in a convex body
Asymptotic shape of a random polytope in a convex body N. Dafnis, A. Giannopoulos, and A. Tsolomitis Abstract Let K be an isotropic convex body in R n and let Z qk be the L q centroid body of K. For every
More informationExercises: Brunn, Minkowski and convex pie
Lecture 1 Exercises: Brunn, Minkowski and convex pie Consider the following problem: 1.1 Playing a convex pie Consider the following game with two players - you and me. I am cooking a pie, which should
More informationTHE DUAL BRUNN-MINKOWSKI THEORY FOR BOUNDED BOREL SETS: DUAL AFFINE QUERMASSINTEGRALS AND INEQUALITIES
June 22, 2007 THE DUAL BRUNN-MINKOWSKI THEORY FOR BOUNDED BOREL SETS: DUAL AFFINE QUERMASSINTEGRALS AND INEQUALITIES R. J. GARDNER Abstract. This paper develops a significant extension of E. Lutwak s dual
More informationTopics in Asymptotic Convex Geometry
T E L A V I V U N I V E R S I T Y The Raymond and Beverley Sackler Faculty of Exact Sciences School of Mathematical Sciences Topics in Asymptotic Convex Geometry Thesis submitted for the degree Doctor
More informationRecent Progress and Open Problems in Algorithmic Convex Geometry
Recent Progress and Open Problems in Algorithmic Convex Geometry Santosh S. Vempala School of Computer Science Algorithms and Randomness Center Georgia Tech, Atlanta, USA 30332 vempala@gatech.edu Abstract
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More informationApproximately gaussian marginals and the hyperplane conjecture
Approximately gaussian marginals and the hyperplane conjecture R. Eldan and B. Klartag Abstract We discuss connections between certain well-known open problems related to the uniform measure on a high-dimensional
More informationDimensional behaviour of entropy and information
Dimensional behaviour of entropy and information Sergey Bobkov and Mokshay Madiman Note: A slightly condensed version of this paper is in press and will appear in the Comptes Rendus de l Académies des
More informationPointwise estimates for marginals of convex bodies
Journal of Functional Analysis 54 8) 75 93 www.elsevier.com/locate/jfa Pointwise estimates for marginals of convex bodies R. Eldan a,1,b.klartag b,, a School of Mathematical Sciences, Tel-Aviv University,
More informationThe minimal volume of simplices containing a convex body
The minimal volume of simplices containing a convex body Mariano Merzbacher (Joint work with Damián Pinasco and Daniel Galicer) Universidad de Buenos Aires and CONICET NonLinear Functional Analysis, Valencia
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More information17.1 Hyperplanes and Linear Forms
This is page 530 Printer: Opaque this 17 Appendix 17.1 Hyperplanes and Linear Forms Given a vector space E over a field K, a linear map f: E K is called a linear form. The set of all linear forms f: E
More informationOn the existence of supergaussian directions on convex bodies
On the existence of supergaussian directions on convex bodies Grigoris Paouris Abstract We study the question whether every centered convex body K of volume 1 in R n has supergaussian directions, which
More informationConvexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.
Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed
More informationAffine surface area and convex bodies of elliptic type
Affine surface area and convex bodies of elliptic type Rolf Schneider Abstract If a convex body K in R n is contained in a convex body L of elliptic type (a curvature image), then it is known that the
More informationNonlinear Programming Models
Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationTopics in Theoretical Computer Science: An Algorithmist's Toolkit Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.409 Topics in Theoretical Computer Science: An Algorithmist's Toolkit Fall 2007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationSolving Convex Programs by Random Walks
Solving Convex Programs by Random Walks DIMITRIS BERTSIMAS AND SANTOSH VEMPALA M.I.T., Cambridge, Massachusetts Abstract. Minimizing a convex function over a convex set in n-dimensional space is a basic,
More informationWeak and strong moments of l r -norms of log-concave vectors
Weak and strong moments of l r -norms of log-concave vectors Rafał Latała based on the joint work with Marta Strzelecka) University of Warsaw Minneapolis, April 14 2015 Log-concave measures/vectors A measure
More informationThe Kannan-Lovász-Simonovits Conjecture
The Kannan-Lovász-Simonovits Conjecture Yin Tat Lee, Santosh S. Vempala December 9, 017 Abstract The Kannan-Lovász-Simonovits conjecture says that the Cheeger constant of any logconcave density is achieved
More informationGeometry of log-concave Ensembles of random matrices
Geometry of log-concave Ensembles of random matrices Nicole Tomczak-Jaegermann Joint work with Radosław Adamczak, Rafał Latała, Alexander Litvak, Alain Pajor Cortona, June 2011 Nicole Tomczak-Jaegermann
More informationInvariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011
Invariances in spectral estimates Franck Barthe Dario Cordero-Erausquin Paris-Est Marne-la-Vallée, January 2011 Notation Notation Given a probability measure ν on some Euclidean space, the Poincaré constant
More informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationAnti-concentration Inequalities
Anti-concentration Inequalities Roman Vershynin Mark Rudelson University of California, Davis University of Missouri-Columbia Phenomena in High Dimensions Third Annual Conference Samos, Greece June 2007
More informationA NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES
A NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES Erwin Lutwak, Deane Yang, and Gaoyong Zhang Department of Mathematics Polytechnic University Brooklyn, NY 11201 Abstract. It is shown that corresponding to
More informationPOLARS AND DUAL CONES
POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.
More informationx log x, which is strictly convex, and use Jensen s Inequality:
2. Information measures: mutual information 2.1 Divergence: main inequality Theorem 2.1 (Information Inequality). D(P Q) 0 ; D(P Q) = 0 iff P = Q Proof. Let ϕ(x) x log x, which is strictly convex, and
More informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) November 6, 2015 1 Lecture 18 1.1 The convex hull Let X be any vector space, and E X a subset. Definition 1.1. The convex hull of E is the
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationOn the isotropic constant of marginals
On the isotropic constant of marginals Grigoris Paouris Abstract Let p < and n. We write µ B,p,n for the probability measure in R n with density B n p, where Bp n := {x R n : x p b p,n} and Bp n =. Let
More informationGeneralized Ham-Sandwich Cuts
DOI 10.1007/s00454-009-9225-8 Generalized Ham-Sandwich Cuts William Steiger Jihui Zhao Received: 17 March 2009 / Revised: 4 August 2009 / Accepted: 14 August 2009 Springer Science+Business Media, LLC 2009
More informationSupplement: Universal Self-Concordant Barrier Functions
IE 8534 1 Supplement: Universal Self-Concordant Barrier Functions IE 8534 2 Recall that a self-concordant barrier function for K is a barrier function satisfying 3 F (x)[h, h, h] 2( 2 F (x)[h, h]) 3/2,
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationSmall faces in stationary Poisson hyperplane tessellations
Small faces in stationary Poisson hyperplane tessellations Rolf Schneider Abstract We consider the tessellation induced by a stationary Poisson hyperplane process in d- dimensional Euclidean space. Under
More informationMeasuring Ellipsoids 1
Measuring Ellipsoids 1 Igor Rivin Temple University 2 What is an ellipsoid? E = {x E n Ax = 1}, where A is a non-singular linear transformation of E n. Remark that Ax = Ax, Ax = x, A t Ax. The matrix Q
More informationOptimizing volume with prescribed diameter or minimum width
Optimizing volume with prescribed diameter or minimum width B. González Merino* (joint with T. Jahn, A. Polyanskii, M. Schymura, and G. Wachsmuth) Berlin *Author partially funded by Fundación Séneca, proyect
More informationAsteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology
for Some for Asteroide Santana, Santanu S. Dey School of Industrial Systems Engineering, Georgia Institute of Technology December 4, 2016 1 / 38 1 1.1 Conic integer programs for Conic integer programs
More informationPolynomiality of Linear Programming
Chapter 10 Polynomiality of Linear Programming In the previous section, we presented the Simplex Method. This method turns out to be very efficient for solving linear programmes in practice. While it is
More informationConve functions 2{2 Conve functions f : R n! R is conve if dom f is conve and y 2 dom f 2 [0 1] + f ( + (1 ; )y) f () + (1 ; )f (y) (1) f is concave i
ELEC-E5420 Conve functions 2{1 Lecture 2 Conve functions conve functions, epigraph simple eamples, elementary properties more eamples, more properties Jensen's inequality quasiconve, quasiconcave functions
More informationSynthetic Geometry. 1.4 Quotient Geometries
Synthetic Geometry 1.4 Quotient Geometries Quotient Geometries Def: Let Q be a point of P. The rank 2 geometry P/Q whose "points" are the lines of P through Q and whose "lines" are the hyperplanes of of
More informationInterplay of convex geometry and Banach space theory
Interplay of convex geometry and Banach space theory Grigoris Paouris (Texas A+M), Carsten Schütt (Christian-Albrechts Universität), Elisabeth Werner (Case Western Reserve University), Deping Ye (Memorial
More informationInteger knapsacks and the Frobenius problem. Lenny Fukshansky Claremont McKenna College
Integer knapsacks and the Frobenius problem Lenny Fukshansky Claremont McKenna College Claremont Statistics, Operations Research, and Math Finance Seminar April 21, 2011 1 Integer knapsack problem Given
More informationHandout 2: Elements of Convex Analysis
ENGG 5501: Foundations of Optimization 2018 19 First Term Handout 2: Elements of Convex Analysis Instructor: Anthony Man Cho So September 10, 2018 As briefly mentioned in Handout 1, the notion of convexity
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationA finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792
Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationDECOUPLING LECTURE 6
18.118 DECOUPLING LECTURE 6 INSTRUCTOR: LARRY GUTH TRANSCRIBED BY DONGHAO WANG We begin by recalling basic settings of multi-linear restriction problem. Suppose Σ i,, Σ n are some C 2 hyper-surfaces in
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationMultiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2
Multiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2 arxiv:quant-ph/0410063v1 8 Oct 2004 Nilanjana Datta Statistical Laboratory Centre for Mathematical Sciences University of Cambridge
More informationAn Improved Construction of Progression-Free Sets
An Improved Construction of Progression-Free Sets Michael Elkin Ben-Gurion University + 1 The Problem Numbers i, j, l form an arithmetic triple if i = j+l 2 or j = i+l 2 or l = i+j 2. A subset S {1,2,...,
More informationRECAP: Extremal problems Examples
RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!
More informationThis chapter reviews some basic geometric facts that we will need during the course.
Chapter 1 Some Basic Geometry This chapter reviews some basic geometric facts that we will need during the course. 1.1 Affine Geometry We will assume that you are familiar with the basic notions of linear
More informationSuper-Gaussian directions of random vectors
Weizmann Institute & Tel Aviv University IMU-INdAM Conference in Analysis, Tel Aviv, June 2017 Gaussian approximation Many distributions in R n, for large n, have approximately Gaussian marginals. Classical
More informationDeviation Measures and Normals of Convex Bodies
Beiträge zur Algebra und Geometrie Contributions to Algebra Geometry Volume 45 (2004), No. 1, 155-167. Deviation Measures Normals of Convex Bodies Dedicated to Professor August Florian on the occasion
More information