Approximating a Convex Body by An Ellipsoid
|
|
- Joan Stone
- 5 years ago
- Views:
Transcription
1 Chapter 1 Approximating a Convex Body by An Ellipsoid By Sariel Har-Peled, May 10, Is there anything in the Geneva Convention about the rules of war in peacetime? Stalnko wanted to know, crawling back toward the truck. Absolutely nothing, Caulec assured him. The rules of war apply only in wartime. In peacetime, anything goes. Gasp, Romain Gary. In this chapter, we show that any convex body can be approximated reasonably well by an ellipsoid. (A quick reminder of linear algebra and the notations we use is provided in Section 1.4 p67.) 1.1 Ellipsoids Definition Let b = { x IR n x 1 be the unit ball. Let c IR n be a vector and let T : IR n IR n be an invertible linear transformation. The set is called an ellipsoid and c is its center. E = T(b) + c Alternatively, we can write E = {x IR n T 1 (x c) 1. However, T 1 (x c) = T 1 (x c), T 1 (x c) = (T 1 (x c)) T T 1 (x c) = (x c) T( T 1) T T 1 (x c). 1 This work is licensed under the Creative Commons Attribution-Noncommercial 3.0 License. To view a copy of this license, visit or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA. 63
2 In particular, let Q = ( T 1) T T 1, and observe that Q is symmetric, and positive definite (see Claim p67 ). Thus, { E = x IR n (x c) T Q(x c) 1. If we change the basis of IR n to be the set of unit eigenvectors of Q, then Q becomes a diagonal matrix, and we have that { E = (y 1,..., y n ) IR n λ 1 (y 1 c 1 ) + + λ n (y n c n ) 1, where c = (c 1,..., c n ) and λ 1,..., λ n are the eigenvalues of Q (all positive since Q is positive definite). In particular, this implies that the points ( c 1,..., c i ± 1/ ) λ i,..., c n, for i = 1,..., n, lies on the boundary of E. Specifically, the eigenvectors are the main axes of the ellipsoid, and their corresponding eigenvalues specify how long is the ellipse along each one of these axes. That is, the ith axis of the ellipsoid E has length 1/ λ i. Visually, the ellipsoid is being created by taking the unit ball, and stretching it by 1/ λ i along its ith axis. In particular, Vol(E) = Vol(b) λ1 λ n = Vol(b) det(q). For a convex body K (i.e., a convex and bounded set), let E be a largest volume ellipsoid contained inside K. One can show that E is unique. Namely, there is a single maximum volume ellipsoid inside K. The following is obvious and is stated for the sake of clarity. Observation 1.1. Given two bodies X, Y IR n such that X Y and a non-singular affine transformation M, then Vol(X)/ Vol(Y) = Vol(M(X))/ Vol(M(Y)) and M(X) M(Y). Theorem Let K IR n be a convex body, and let E { K be its maximum volume ellipsoid. Suppose that E is centered at the origin, then E K n E = nx x E. Proof : By applying an affine transformation (and by Observation 1.1.), we can assume that E is the unit ball b. Assume, for the sake of contradiction, that there is a point p K, such that p > n. Consider the set C which is the convex-hull of {p b. Since K is convex, we have that C K. We will reach a contradiction, by finding an ellipsoid G which has volume larger than b and is enclosed inside C. By rotating space, we can assume that the apex p of C is the point (ρ, 0,..., 0), for ρ > n. We consider ellipsoids of the form G = (y 1,..., y n ) (y 1 τ) + 1 n y α β i 1. i= ( 1, 0) o β α { { (τ, 0) p = (ρ, 0) (Using the notations above we have λ 1 = 1/α, λ =... = λ n = 1/β, c 1 = τ and c = = c n = 0.) We need to pick the values of τ, α and β such that G C. Observe that by symmetry, it is enough to enforce that G C in the first two dimensions. 64
3 Thus, we can consider C and G to be in two dimensions. Now, the center of G is going to be on the x-axis, at the point (τ, 0). The set G is an ellipse with axes parallel to the x and y axes. In particular, we require that ( 1, 0) be on the boundary of G. This implies that ( 1 τ) = α. Now, the center point (τ, 0) can be anywhere on the interval between the origin and the midpoint between ( 1, 0) and p = (ρ, 0). As such, we conclude that 0 τ (ρ + ( 1))/. Namely, In particular, the equation of the curve forming (the boundary of) G is α = 1 + τ. (1.1) F(x, y) = (x τ) (1 + τ) + y 1 = 0. (1.) β We next compute the value of β. Consider the tangent l to the unit circle that passes through p = (ρ, 0). Let q be the point where l touches the unit circle. (See figure on the right.) We have poq oqs, since oq form a right angle with pq, where s = (0, s y ). Since q o = 1, we have s q = s q q o = q o o p = 1 ρ. ( 1, 0) G C s o q (τ, 0) l (u, v) p = (ρ, 0) Furthermore, since q is on the unit circle, we have As such, the equation of the line l is q = ( 1/ρ, 1 1/ρ ). q, (x, y) = 1 x ρ + 1 1/ρ y = 1 l y = 1 ρ 1 x + ρ ρ 1. Next, consider the tangent line l to G at some point (u, v). We will derive a formula for l as a function of (u, v) and then require that l = l. (Thus, (u, v) will be the intersection point of G and l, which exists as G is as large as possible.) The slope of the l is the slope of the tangent to G at (u, v). We now compute the derivative of the implicit function F (see Eq. (1.) above) at (u, v), which is dy dx = F ( ) ( ) x(u, v) (u τ) v F y (u, v) = / (1 + τ) β = β (u τ) v(1 + τ) by computing the derivatives of the implicit function F. Since α = 1 + τ (see Eq. (1.1)), the line l is (u τ) α (x τ) + v β y = 1, For the rusty reader (and the rustier author) here is a quicky proof of the formula for derivative of an implicit function in two dimensions: Locally near (u, v) the function F(x, y) behaves like the linear function G(x, y) = (x u)f x (u, v) + (y v)f y (u, v). The curve is defined by F(x, y) = 0, which locally is equivalent to G(x, y) = 0. But G(x, y) = 0 is a line (which is the tangent line to F(x, y) at (u, v)). Rearranging, we get that y = ( F x (u, v)/f y (u, v) ) x + whatever, establishing the claim. 65
4 since it has the required slope and it passes through (u, v), as (u, v) G and by Eq. (1.). Namely l y = β (u τ) (x τ) + β vα v. Setting l = l, we have that the line l passes through (ρ, 0). As such, (ρ τ)(u τ) (u τ) = 1 = α (u τ) α = α α ρ τ α (ρ τ). (1.3) Since l and l are the same line, we can equate their slopes; namely, However, by Eq. (1.3), we have Thus, β (u τ) vα β (u τ) vα = = β (u τ) vα α β v = 1 ρ 1. = β vα α ρ τ = β v(ρ τ). ρ τ ρ 1. Squaring and inverting both sides, we have v β = ρ 1 v and thus 4 (ρ τ) β = ρ 1 β. The point (ρ τ) (u τ) (u, v) G, and as such + v = 1. Using Eq. (1.3) and the above, we get α β and thus α (ρ τ) + ρ 1 β (ρ τ) = 1, β = (ρ τ) α = (ρ τ) (τ + 1) ρ 1 ρ 1 (ρ τ 1)(ρ + 1) = = ρ τ 1 ρ 1 ρ 1 = ρ ρτ τ 1 ρ 1 = 1 τ ρ 1. Namely, for n, and 0 τ < (ρ 1)/, we have that the ellipsoid G is defined by the parameters α = 1 + τ and β, and it is contained inside the cone C. It holds that Vol(G) = β n 1 α Vol(b), and thus µ = ln Vol(G) Vol(b) = (n 1) ln β + ln α = n 1 ln β + ln α. For τ > 0 sufficiently small, we have ln α = ln(1 + τ) = τ + O(τ ), because of the Taylor expansion ln(1 + x) = x x / + x 3 /3, for 1 < x 1. Similarly, ln β = ln ( ) 1 τ ρ 1 = τ + ρ 1 O(τ ). Thus, µ = n 1 ( τ ) ( ρ 1 + O(τ ) + τ + O(τ ) = 1 n 1 ) τ + O(τ ) > 0, ρ 1 for τ sufficiently small and if ρ > n. Thus, Vol(G)/ Vol(b) = exp(µ) > 1 implying that Vol(G) > Vol(b). A contradiction. 66
5 A convex body K centered at the origin is symmetric if p K, implies that p K. Interestingly, the constant in Theorem can be improved to n in this case. We omit the proof, since it is similar to the proof of Theorem Theorem Let K IR n be a symmetric convex body, and let E K be its maximum volume ellipsoid. Suppose that E is centered at the origin, then K n E. 1. Bibliographical notes We closely follow the exposition of Barvinok [Bar0]. The maximum volume ellipsoid is sometimes referred to as John s ellipsoid. In particular, Theorem is known as John s theorem, and was originally proved by Fritz John [Joh48]. One can approximate the John ellipsoid using interior point techniques [GLS88]. However, this is not very efficient in low dimensions. In the next chapter, we will show how to do this by other (simpler) techniques, which are faster (and simpler) for point sets in low dimensions. There are numerous interesting results in convexity theory about what convex shapes look like. One of the surprising results is Dvoretsky s theorem, which states that any symmetric convex body K around the origin (in high enough dimension) can be cut by a k-dimensional subspace, such that the intersection of K with this k-dimensional space, contains an ellipsoid E and is contained inside an ellipsoid (1 + ε)e (k here is an arbitrary parameter). Since one can define a metric in a Banach space by providing a symmetric convex body which defines the unit ball, this implies that any high enough dimensional Banach space contains (up to translation that maps the ellipsoid to a ball) a subspace which is almost Euclidean. A survey of those results is provided by Ball [Bal97]. 1.3 From previous lectures 1.4 Linear Algebra Claim If M is a positive definite matrix then there exists a matrix B such that M = N T B and B is not singular. Bibliography [Bal97] [Bar0] K. Ball. An elementary introduction to modern convex geometry. In Flavors of geometry, volume MSRI Publ. 31. Cambridge Univ. Press, publications/books/book31/files/ball.pdf. A. Barvinok. A course in convexity, volume 54 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI,
6 [GLS88] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg, nd edition, nd edition [Joh48] F. John. Extremum problems with inequalities as subsidary conditions. Courant Anniversary, pages , [Leo98] S. J. Leon. Linear Algebra with Applications. Prentice Hall, 5th edition,
Chapter 23. Fast Fourier Transform Introduction. By Sariel Har-Peled, November 28, Version: 0.11
Chapter 23 Fast Fourier Transform By Sariel Har-Peled, November 28, 208 Version: 0 But now, reflecting further, there begins to creep into his breast a touch of fellow-feeling for his imitators For it
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 informationLATTICE POINT COVERINGS
LATTICE POINT COVERINGS MARTIN HENK AND GEORGE A. TSINTSIFAS Abstract. We give a simple proof of a necessary and sufficient condition under which any congruent copy of a given ellipsoid contains an integral
More informationCSC Linear Programming and Combinatorial Optimization Lecture 8: Ellipsoid Algorithm
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 8: Ellipsoid Algorithm Notes taken by Shizhong Li March 15, 2005 Summary: In the spring of 1979, the Soviet mathematician L.G.Khachian
More informationConcave and Convex Functions 1
John Nachbar Washington University March 6, 2017 Concave and Convex Functions 1 1 Basic Definitions Definition 1 Let C R N be convex and let f : C R 1 (a) f is concave iff for any a, b C and any θ [0,
More informationChapter 11. Min Cut Min Cut Problem Definition Some Definitions. By Sariel Har-Peled, December 10, Version: 1.
Chapter 11 Min Cut By Sariel Har-Peled, December 10, 013 1 Version: 1.0 I built on the sand And it tumbled down, I built on a rock And it tumbled down. Now when I build, I shall begin With the smoke from
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
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 informationConcave and Convex Functions 1
John Nachbar Washington University March 27, 2018 Concave and Convex Functions 1 1 Basic Definitions. Definition 1. Let C R N be non-empty and convex and let f : C R. 1. (a) f is concave iff for any a,
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 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 informationMini Lecture 2.1 Introduction to Functions
Mini Lecture.1 Introduction to Functions 1. Find the domain and range of a relation.. Determine whether a relation is a function. 3. Evaluate a function. 1. Find the domain and range of the relation. a.
More informationMathematical Analysis Outline. William G. Faris
Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,
More informationReconstructing an Ellipsoid from its Perspective Projection onto a Plane
Reconstructing an Ellipsoid from its Perspective Projection onto a Plane David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons
More informationAn Algorithmist s Toolkit Nov. 10, Lecture 17
8.409 An Algorithmist s Toolkit Nov. 0, 009 Lecturer: Jonathan Kelner Lecture 7 Johnson-Lindenstrauss Theorem. Recap We first recap a theorem (isoperimetric inequality) and a lemma (concentration) from
More informationWe wish the reader success in future encounters with the concepts of linear algebra.
Afterword Our path through linear algebra has emphasized spaces of vectors in dimension 2, 3, and 4 as a means of introducing concepts which go forward to IRn for arbitrary n. But linear algebra does not
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
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 informationSolving Systems of Polynomial Equations
Solving Systems of Polynomial Equations David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationRecognise the Equation of a Circle. Solve Problems about Circles Centred at O. Co-Ordinate Geometry of the Circle - Outcomes
1 Co-Ordinate Geometry of the Circle - Outcomes Recognise the equation of a circle. Solve problems about circles centred at the origin. Solve problems about circles not centred at the origin. Determine
More informationOn the discrepancy of circular sequences of reals
On the discrepancy of circular sequences of reals Fan Chung Ron Graham Abstract In this paper we study a refined measure of the discrepancy of sequences of real numbers in [0, ] on a circle C of circumference.
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationCLASSIFICATIONS OF THE FLOWS OF LINEAR ODE
CLASSIFICATIONS OF THE FLOWS OF LINEAR ODE PETER ROBICHEAUX Abstract. The goal of this paper is to examine characterizations of linear differential equations. We define the flow of an equation and examine
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationTangent spaces, normals and extrema
Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent
More informationSystems of Equations and Inequalities. College Algebra
Systems of Equations and Inequalities College Algebra System of Linear Equations There are three types of systems of linear equations in two variables, and three types of solutions. 1. An independent system
More informationCOMP 558 lecture 18 Nov. 15, 2010
Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
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 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 informationIntersection of Rectangle and Ellipse
Intersection of Rectangle and Ellipse David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationTrust Regions. Charles J. Geyer. March 27, 2013
Trust Regions Charles J. Geyer March 27, 2013 1 Trust Region Theory We follow Nocedal and Wright (1999, Chapter 4), using their notation. Fletcher (1987, Section 5.1) discusses the same algorithm, but
More informationA glimpse into convex geometry. A glimpse into convex geometry
A glimpse into convex geometry 5 \ þ ÏŒÆ Two basis reference: 1. Keith Ball, An elementary introduction to modern convex geometry 2. Chuanming Zong, What is known about unit cubes Convex geometry lies
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationCopyright c 2007 Jason Underdown Some rights reserved. quadratic formula. absolute value. properties of absolute values
Copyright & License Formula Copyright c 2007 Jason Underdown Some rights reserved. quadratic formula absolute value properties of absolute values equation of a line in various forms equation of a circle
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationLecture 1: Introduction. Outline. B9824 Foundations of Optimization. Fall Administrative matters. 2. Introduction. 3. Existence of optima
B9824 Foundations of Optimization Lecture 1: Introduction Fall 2009 Copyright 2009 Ciamac Moallemi Outline 1. Administrative matters 2. Introduction 3. Existence of optima 4. Local theory of unconstrained
More informationContents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124
Matrices Math 220 Copyright 2016 Pinaki Das This document is freely redistributable under the terms of the GNU Free Documentation License For more information, visit http://wwwgnuorg/copyleft/fdlhtml Contents
More informationConvergence in shape of Steiner symmetrized line segments. Arthur Korneychuk
Convergence in shape of Steiner symmetrized line segments by Arthur Korneychuk A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Mathematics
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationYou can learn more about the services offered by the teaching center by visiting
MAC 232 Exam 3 Review Spring 209 This review, produced by the Broward Teaching Center, contains a collection of questions which are representative of the type you may encounter on the exam. Other resources
More information8 Eigenvectors and the Anisotropic Multivariate Gaussian Distribution
Eigenvectors and the Anisotropic Multivariate Gaussian Distribution Eigenvectors and the Anisotropic Multivariate Gaussian Distribution EIGENVECTORS [I don t know if you were properly taught about eigenvectors
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More informationDistance Between Ellipses in 2D
Distance Between Ellipses in 2D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To
More informationRose-Hulman Undergraduate Mathematics Journal
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 5 Reversing A Doodle Bryan A. Curtis Metropolitan State University of Denver Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationAnother Low-Technology Estimate in Convex Geometry
Convex Geometric Analysis MSRI Publications Volume 34, 1998 Another Low-Technology Estimate in Convex Geometry GREG KUPERBERG Abstract. We give a short argument that for some C > 0, every n- dimensional
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
More informationIntersection of Ellipses
Intersection of Ellipses David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
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 informationELLIPTIC CURVES BJORN POONEN
ELLIPTIC CURVES BJORN POONEN 1. Introduction The theme of this lecture is to show how geometry can be used to understand the rational number solutions to a polynomial equation. We will illustrate this
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationLEVEL MATRICES G. SEELINGER, P. SISSOKHO, L. SPENCE, AND C. VANDEN EYNDEN
LEVEL MATRICES G. SEELINGER, P. SISSOKHO, L. SPENCE, AND C. VANDEN EYNDEN Abstract. Let n > 1 and k > 0 be fixed integers. A matrix is said to be level if all its column sums are equal. A level matrix
More informationLecture 5 : Projections
Lecture 5 : Projections EE227C. Lecturer: Professor Martin Wainwright. Scribe: Alvin Wan Up until now, we have seen convergence rates of unconstrained gradient descent. Now, we consider a constrained minimization
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 informationTEST CODE: MMA (Objective type) 2015 SYLLABUS
TEST CODE: MMA (Objective type) 2015 SYLLABUS Analytical Reasoning Algebra Arithmetic, geometric and harmonic progression. Continued fractions. Elementary combinatorics: Permutations and combinations,
More informationMAC College Algebra
MAC 05 - College Algebra Name Review for Test 2 - Chapter 2 Date MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Find the exact distance between the
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. M. A. and M.Sc. Scholarship Test. September 25, Time Allowed: 150 Minutes Maximum Marks: 30
NATIONAL BOARD FOR HIGHER MATHEMATICS M. A. and M.Sc. Scholarship Test September 25, 2010 Time Allowed: 150 Minutes Maximum Marks: 30 Please read, carefully, the instructions on the following page 1 INSTRUCTIONS
More information1 Principal component analysis and dimensional reduction
Linear Algebra Working Group :: Day 3 Note: All vector spaces will be finite-dimensional vector spaces over the field R. 1 Principal component analysis and dimensional reduction Definition 1.1. Given an
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationA Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization James B. Orlin Sloan School of Management, MIT Cambridge, MA 02139 jorlin@mit.edu Abstract. We consider the problem of minimizing
More informationConvex Functions and Optimization
Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized
More informationLacunary Polynomials over Finite Fields Course notes
Lacunary Polynomials over Finite Fields Course notes Javier Herranz Abstract This is a summary of the course Lacunary Polynomials over Finite Fields, given by Simeon Ball, from the University of London,
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationALGEBRAIC GEOMETRY HOMEWORK 3
ALGEBRAIC GEOMETRY HOMEWORK 3 (1) Consider the curve Y 2 = X 2 (X + 1). (a) Sketch the curve. (b) Determine the singular point P on C. (c) For all lines through P, determine the intersection multiplicity
More informationDirectional Derivatives in the Plane
Directional Derivatives in the Plane P. Sam Johnson April 10, 2017 P. Sam Johnson (NIT Karnataka) Directional Derivatives in the Plane April 10, 2017 1 / 30 Directional Derivatives in the Plane Let z =
More informationMath 291-2: Final Exam Solutions Northwestern University, Winter 2016
Math 29-2: Final Exam Solutions Northwestern University, Winter 206 Determine whether each of the following statements is true or false f it is true, explain why; if it is false, give a counterexample
More informationBackground on Linear Algebra - Lecture 2
Background on Linear Algebra - Lecture September 6, 01 1 Introduction Recall from your math classes the notion of vector spaces and fields of scalars. We shall be interested in finite dimensional vector
More informationC-1. Snezana Lawrence
C-1 Snezana Lawrence These materials have been written by Dr. Snezana Lawrence made possible by funding from Gatsby Technical Education projects (GTEP) as part of a Gatsby Teacher Fellowship ad-hoc bursary
More informationAfter taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.
Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric
More informationLecture 1: Systems of linear equations and their solutions
Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications
More informationMathematical foundations - linear algebra
Mathematical foundations - linear algebra Andrea Passerini passerini@disi.unitn.it Machine Learning Vector space Definition (over reals) A set X is called a vector space over IR if addition and scalar
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationy mx 25m 25 4 circle. Then the perpendicular distance of tangent from the centre (0, 0) is the radius. Since tangent
Mathematics. The sides AB, BC and CA of ABC have, 4 and 5 interior points respectively on them as shown in the figure. The number of triangles that can be formed using these interior points is () 80 ()
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 informationMustapha Ç. Pinar 1. Communicated by Jean Abadie
RAIRO Operations Research RAIRO Oper. Res. 37 (2003) 17-27 DOI: 10.1051/ro:2003012 A DERIVATION OF LOVÁSZ THETA VIA AUGMENTED LAGRANGE DUALITY Mustapha Ç. Pinar 1 Communicated by Jean Abadie Abstract.
More informationOn self-circumferences in Minkowski planes
extracta mathematicae Article in press On self-circumferences in Minkowski planes Mostafa Ghandehari, Horst Martini Department of Mathematics, University of Texas at Arlington, TX 76019, U.S.A. Faculty
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationNon-Solvable Spaces of Linear Equation Systems
International J.Math. Combin. Vol.2(212), 9-23 Non-Solvable Spaces of Linear Equation Systems Linfan Mao (Chinese Academy of Mathematics and System Science, Beijing 119, P.R.China) E-mail: maolinfan@163.com
More informationKing Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)
Math 001 - Term 161 Recitation (R1, R) Question 1: How many rational and irrational numbers are possible between 0 and 1? (a) 1 (b) Finite (c) 0 (d) Infinite (e) Question : A will contain how many elements
More informationMA4001 Engineering Mathematics 1 Lecture 15 Mean Value Theorem Increasing and Decreasing Functions Higher Order Derivatives Implicit Differentiation
MA4001 Engineering Mathematics 1 Lecture 15 Mean Value Theorem Increasing and Decreasing Functions Higher Order Derivatives Implicit Differentiation Dr. Sarah Mitchell Autumn 2014 Rolle s Theorem Theorem
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationSPECTRAHEDRA. Bernd Sturmfels UC Berkeley
SPECTRAHEDRA Bernd Sturmfels UC Berkeley GAeL Lecture I on Convex Algebraic Geometry Coimbra, Portugal, Monday, June 7, 2010 Positive Semidefinite Matrices For a real symmetric n n-matrix A the following
More informationLECTURE 5, FRIDAY
LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we
More informationDepartment of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections 3.1, 3.3, and 3.5
Department of Mathematics, University of Wisconsin-Madison Math 11 Worksheet Sections 3.1, 3.3, and 3.5 1. For f(x) = 5x + (a) Determine the slope and the y-intercept. f(x) = 5x + is of the form y = mx
More informationLINEAR PROGRAMMING III
LINEAR PROGRAMMING III ellipsoid algorithm combinatorial optimization matrix games open problems Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM LINEAR PROGRAMMING III ellipsoid algorithm
More informationCS675: Convex and Combinatorial Optimization Spring 2018 The Ellipsoid Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 The Ellipsoid Algorithm Instructor: Shaddin Dughmi History and Basics Originally developed in the mid 70s by Iudin, Nemirovski, and Shor for use
More informationLecture 1: Introduction. Outline. B9824 Foundations of Optimization. Fall Administrative matters. 2. Introduction. 3. Existence of optima
B9824 Foundations of Optimization Lecture 1: Introduction Fall 2010 Copyright 2010 Ciamac Moallemi Outline 1. Administrative matters 2. Introduction 3. Existence of optima 4. Local theory of unconstrained
More informationLecture 3 Math & Probability Background
Lecture 3 Math & Probability Background ch. 1-2 of Machine Vision by Wesley E. Snyder & Hairong Qi Spring 2019 16-725 (CMU RI) : BioE 2630 (Pitt) Dr. John Galeotti The content of these slides by John Galeotti,
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informatione x3 dx dy. 0 y x 2, 0 x 1.
Problem 1. Evaluate by changing the order of integration y e x3 dx dy. Solution:We change the order of integration over the region y x 1. We find and x e x3 dy dx = y x, x 1. x e x3 dx = 1 x=1 3 ex3 x=
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More information7. Lecture notes on the ellipsoid algorithm
Massachusetts Institute of Technology Michel X. Goemans 18.433: Combinatorial Optimization 7. Lecture notes on the ellipsoid algorithm The simplex algorithm was the first algorithm proposed for linear
More informationTEST CODE: PMB SYLLABUS
TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional
More informationThe Banach-Tarski paradox
The Banach-Tarski paradox 1 Non-measurable sets In these notes I want to present a proof of the Banach-Tarski paradox, a consequence of the axiom of choice that shows us that a naive understanding of the
More information0 MATH Last Updated: September 7, 2012
Problem List 0.1 Trig. Identity 0.2 Basic vector properties (Numeric) 0.3 Basic vector properties (Conceptual) 0.4 Vector decomposition (Conceptual) 0.5 Div, grad, curl, and all that 0.6 Curl of a grad
More informationGeometric problems. Chapter Projection on a set. The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as
Chapter 8 Geometric problems 8.1 Projection on a set The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as dist(x 0,C) = inf{ x 0 x x C}. The infimum here is always achieved.
More information