A Course in Convexity
|
|
- Clarissa Peters
- 5 years ago
- Views:
Transcription
1 A Course in Convexity Alexander Barvinok Graduate Studies in Mathematics Volume 54 American Mathematical Society Providence, Rhode Island
2 Preface vii Chapter I. Convex Sets at Large 1 1. Convex Sets. Main Definitions, Some Interesting Examples and Problems 1 2. Properties of the Convex Hull. Caratheodory's Theorem 7 3. An Application: Positive Polynomials Theorems of Radon and Helly Applications of Helly's Theorem in Combinatorial Geometry An Application to Approximation The Euler Characteristic Application: Convex Sets and Linear Transformations Polyhedra and Linear Transformations Remarks 39 Chapter II. Faces and Extreme Points The Isolation Theorem Convex Sets in Euclidean Space Extreme Points. The Krein-Milman Theorem for Euclidean Space Extreme Points of Polyhedra 53 in
3 iv 5. The Birkhoff Polytope The Permutation Polytope and the Schur-Horn Theorem The Transportation Polyhedron Convex Cones The Moment Curve and the Moment Cone An Application: "Double Precision" Formulas for Numerical Integration The Cone of Non-negative Polynomials The Cone of Positive Semidefinite Matrices Linear Equations in Positive Semidefinite Matrices Applications: Quadratic Convexity Theorems Applications: Problems of Graph Realizability Closed Convex Sets Remarks 103 Chapter III. Convex Sets in Topological Vector Spaces Separation Theorems in Euclidean Space and Beyond Topological Vector Spaces, Convex Sets and Hyperplanes Separation Theorems in Topological Vector Spaces The Krein-Milman Theorem for Topological Vector Spaces Polyhedra in L An Application: Problems of Linear Optimal Control An Application: The Lyapunov Convexity Theorem The "Simplex" of Probability Measures Extreme Points of the Intersection. Applications Remarks 141 Chapter IV. Polarity, Duality and Linear Programming Polarity in Euclidean Space An Application: Recognizing Points in the Moment Cone Duality of Vector Spaces Duality of Topological Vector Spaces Ordering a Vector Space by a Cone Linear Programming Problems Zero Duality Gap Polyhedral Linear Programming 172
4 9. An Application: The Transportation Problem Semidefinite Programming An Application: The Clique and Chromatic Numbers of a Graph Linear Programming in L Uniform Approximation as a Linear Programming Problem The Mass-Transfer Problem Remarks 202 Chapter V. Convex Bodies and Ellipsoids Ellipsoids The Maximum Volume Ellipsoid of a Convex Body Norms and Their Approximations The Ellipsoid Method The Gaussian Measure on Euclidean Space Applications to Low Rank Approximations of Matrices The Measure and Metric on the Unit Sphere Remarks 248 Chapter VI. Faces of Polytopes Polytopes and Polarity The Facial Structure of the Permutation Polytope The Euler-Poincare Formula Polytopes with Many Faces: Cyclic Polytopes Simple Polytopes The /i-vector of a Simple Polytope. Dehn-Sommerville Equations The Upper Bound Theorem Centrally Symmetric Polytopes Remarks 277 Chapter VII. Lattices and Convex Bodies Lattices The Determinant of a Lattice Minkowski's Convex Body Theorem 293
5 vi 4. Applications: Sums of Squares and Rational Approximations Sphere Packings The Minkowski-Hlawka Theorem The Dual Lattice The Flatness Theorem Constructing a Short Vector and a Reduced Basis Remarks 324 Chapter VIII. Lattice Points and Polyhedra Generating Functions and Simple Rational Cones Generating Functions and Rational Cones Generating Functions and Rational Polyhedra Brion's Theorem The Ehrhart Polynomial of a Polytope Example: Totally Unimodular Polytopes Remarks 356 Bibliography 357 Index 363
THEORY OF LINEAR AND INTEGER PROGRAMMING
THEORY OF LINEAR AND INTEGER PROGRAMMING ALEXANDER SCHRIJVER Centrum voor Wiskunde en Informatica, Amsterdam A Wiley-Inter science Publication JOHN WILEY & SONS^ Chichester New York Weinheim Brisbane Singapore
More informationCOMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)
COMP331/557 Chapter 2: The Geometry of Linear Programming (Bertsimas & Tsitsiklis, Chapter 2) 49 Polyhedra and Polytopes Definition 2.1. Let A 2 R m n and b 2 R m. a set {x 2 R n A x b} is called polyhedron
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationContents. Preface... VII. Part I Classical Topics Revisited
Contents Preface........................................................ VII Part I Classical Topics Revisited 1 Sphere Packings........................................... 3 1.1 Kissing Numbers of Spheres..............................
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More informationbe a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that
( Shelling (Bruggesser-Mani 1971) and Ranking Let be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that. a ranking of vertices
More informationDISCRETE CONVEX ANALYSIS
DISCRETE CONVEX ANALYSIS o KAZUO MUROTA University of Tokyo; PRESTO, JST Tokyo, Japan Society for Industrial and Applied Mathematics Philadelphia List of Figures Notation Preface xi xiii xxi 1 Introduction
More informationPOLYTOPES. Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of convex polytopes.
POLYTOPES MARGARET A. READDY 1. Lecture I: Introduction to Polytopes and Face Enumeration Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of
More informationPolytopes Course Notes
Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................
More information2. Convex sets. x 1. x 2. affine set: contains the line through any two distinct points in the set
2. Convex sets Convex Optimization Boyd & Vandenberghe affine and convex sets some important examples operations that preserve convexity generalized inequalities separating and supporting hyperplanes dual
More informationInteger and Combinatorial Optimization
Integer and Combinatorial Optimization GEORGE NEMHAUSER School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, Georgia LAURENCE WOLSEY Center for Operations Research and
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationConvex Optimization. Convex Sets. ENSAE: Optimisation 1/24
Convex Optimization Convex Sets ENSAE: Optimisation 1/24 Today affine and convex sets some important examples operations that preserve convexity generalized inequalities separating and supporting hyperplanes
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More informationCS675: Convex and Combinatorial Optimization Spring 2018 Convex Sets. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 Convex Sets Instructor: Shaddin Dughmi Outline 1 Convex sets, Affine sets, and Cones 2 Examples of Convex Sets 3 Convexity-Preserving Operations
More information2. Convex sets. affine and convex sets. some important examples. operations that preserve convexity. generalized inequalities
2. Convex sets Convex Optimization Boyd & Vandenberghe affine and convex sets some important examples operations that preserve convexity generalized inequalities separating and supporting hyperplanes dual
More informationLinear Optimization and Extensions: Theory and Algorithms
AT&T Linear Optimization and Extensions: Theory and Algorithms Shu-Cherng Fang North Carolina State University Sarai Puthenpura AT&T Bell Labs Prentice Hall, Englewood Cliffs, New Jersey 07632 Contents
More informationContents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited.
page v Preface xiii I Basics 1 1 Optimization Models 3 1.1 Introduction... 3 1.2 Optimization: An Informal Introduction... 4 1.3 Linear Equations... 7 1.4 Linear Optimization... 10 Exercises... 12 1.5
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationGEOMETRIC TOOLS FOR COMPUTER GRAPHICS
GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W
More informationEc 181: Convex Analysis and Economic Theory
Division of the Humanities and Social Sciences Ec 181: Convex Analysis and Economic Theory KC Border Winter 2018 v. 2018.03.08::13.11 src: front KC Border: for Ec 181, Winter 2018 Woe to the author who
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationof Convex Analysis Fundamentals Jean-Baptiste Hiriart-Urruty Claude Lemarechal Springer With 66 Figures
2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. Jean-Baptiste Hiriart-Urruty Claude Lemarechal Fundamentals of Convex
More information60 2 Convex sets. {x a T x b} {x ã T x b}
60 2 Convex sets Exercises Definition of convexity 21 Let C R n be a convex set, with x 1,, x k C, and let θ 1,, θ k R satisfy θ i 0, θ 1 + + θ k = 1 Show that θ 1x 1 + + θ k x k C (The definition of convexity
More informationTHE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE
DUKE-CGTP-04-07 THE REFLEXIVE DIMENSION OF A LATTICE POLYTOPE CHRISTIAN HAASE AND ILARION V. MELNIKOV Abstract. The reflexive dimension refldim(p ) of a lattice polytope P is the minimal d so that P is
More informationConvex Sets (cont.) Convex Functions
Convex Sets (cont.) Convex Functions Optimization - 10725 Carlos Guestrin Carnegie Mellon University February 27 th, 2008 1 Definitions of convex sets Convex v. Non-convex sets Line segment definition:
More informationDiscrete Volume Computations. for Polyhedra
Digital Discrete Volume Computations y for Polyhedra 20 Matthias Beck San Francisco State University math.sfsu.edu/beck DGCI 2016 5 x z 2 Science is what we understand well enough to explain to a computer,
More informationLecture 2 Convex Sets
Optimization Theory and Applications Lecture 2 Convex Sets Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Fall 2016 2016/9/29 Lecture 2: Convex Sets 1 Outline
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 4: Convex Sets. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 4: Convex Sets Instructor: Shaddin Dughmi Announcements New room: KAP 158 Today: Convex Sets Mostly from Boyd and Vandenberghe. Read all of
More informationLARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH
LARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH Richard Kipp Martin Graduate School of Business University of Chicago % Kluwer Academic Publishers Boston/Dordrecht/London CONTENTS Preface
More informationThe Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli. Christopher Abram
The Construction of a Hyperbolic 4-Manifold with a Single Cusp, Following Kolpakov and Martelli by Christopher Abram A Thesis Presented in Partial Fulfillment of the Requirement for the Degree Master of
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationPolar Duality and Farkas Lemma
Lecture 3 Polar Duality and Farkas Lemma October 8th, 2004 Lecturer: Kamal Jain Notes: Daniel Lowd 3.1 Polytope = bounded polyhedron Last lecture, we were attempting to prove the Minkowsky-Weyl Theorem:
More informationTutorial on Convex Optimization for Engineers
Tutorial on Convex Optimization for Engineers M.Sc. Jens Steinwandt Communications Research Laboratory Ilmenau University of Technology PO Box 100565 D-98684 Ilmenau, Germany jens.steinwandt@tu-ilmenau.de
More informationIndex. 0/1 linear integer minimization, colorability, 245 4ti2, 80, 83
Index 0/1 linear integer minimization, 100 3-colorability, 245 4ti2, 80, 83 absolute convergence, 107, 130 affine combination, 3 affine hull, 18 affine hyperplane, 4 algebraic closure, 193, 238, 242, 256
More informationConvexity: an introduction
Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationConvex Optimization M2
Convex Optimization M2 Lecture 1 A. d Aspremont. Convex Optimization M2. 1/49 Today Convex optimization: introduction Course organization and other gory details... Convex sets, basic definitions. A. d
More informationVoronoi Diagrams, Delaunay Triangulations and Polytopes
Voronoi Diagrams, Delaunay Triangulations and Polytopes Jean-Daniel Boissonnat MPRI, Lecture 2 Computational Geometry Learning Voronoi, Delaunay & Polytopes MPRI, Lecture 2 1 / 43 Voronoi diagrams in nature
More informationConvex Sets. CSCI5254: Convex Optimization & Its Applications. subspaces, affine sets, and convex sets. operations that preserve convexity
CSCI5254: Convex Optimization & Its Applications Convex Sets subspaces, affine sets, and convex sets operations that preserve convexity generalized inequalities separating and supporting hyperplanes dual
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationOn the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes Hans Raj Tiwary hansraj@cs.uni-sb.de FR Informatik Universität des Saarlandes D-66123 Saarbrücken, Germany Tel: +49 681 3023235
More informationCircuit Walks in Integral Polyhedra
Circuit Walks in Integral Polyhedra Charles Viss Steffen Borgwardt University of Colorado Denver Optimization and Discrete Geometry: Theory and Practice Tel Aviv University, April 2018 LINEAR PROGRAMMING
More informationAn Introduction to Geometrical Probability
An Introduction to Geometrical Probability Distributional Aspects with Applications A. M. Mathai McGill University Montreal, Canada Gordon and Breach Science Publishers Australia Canada China Prance Germany
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
More informationCREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais
Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant
More informationGift Wrapping for Pretropisms
Gift Wrapping for Pretropisms Jan Verschelde University of Illinois at Chicago Department of Mathematics, Statistics, and Computer Science http://www.math.uic.edu/ jan jan@math.uic.edu Graduate Computational
More informationDavid G. Luenberger Yinyu Ye. Linear and Nonlinear. Programming. Fourth Edition. ö Springer
David G. Luenberger Yinyu Ye Linear and Nonlinear Programming Fourth Edition ö Springer Contents 1 Introduction 1 1.1 Optimization 1 1.2 Types of Problems 2 1.3 Size of Problems 5 1.4 Iterative Algorithms
More informationNonlinear Programming
Nonlinear Programming SECOND EDITION Dimitri P. Bertsekas Massachusetts Institute of Technology WWW site for book Information and Orders http://world.std.com/~athenasc/index.html Athena Scientific, Belmont,
More informationDiscrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity
Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows
More informationLinear programming and the efficiency of the simplex algorithm for transportation polytopes
Linear programming and the efficiency of the simplex algorithm for transportation polytopes Edward D. Kim University of Wisconsin-La Crosse February 20, 2015 Loras College Department of Mathematics Colloquium
More informationSubmodularity Reading Group. Matroid Polytopes, Polymatroid. M. Pawan Kumar
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar http://www.robots.ox.ac.uk/~oval/ Outline Linear Programming Matroid Polytopes Polymatroid Polyhedron Ax b A : m x n matrix b:
More informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
More informationConvex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015
Convex Optimization - Chapter 1-2 Xiangru Lian August 28, 2015 1 Mathematical optimization minimize f 0 (x) s.t. f j (x) 0, j=1,,m, (1) x S x. (x 1,,x n ). optimization variable. f 0. R n R. objective
More informationNotes on Convex Sets, Polytopes, Polyhedra, Combinatorial Topology, Voronoi Diagrams and Delaunay Triangulations
Notes on Convex Sets, Polytopes, Polyhedra, Combinatorial Topology, Voronoi Diagrams and Delaunay Triangulations Jean Gallier and Jocelyn Quaintance Department of Computer and Information Science University
More informationApplied Integer Programming
Applied Integer Programming D.S. Chen; R.G. Batson; Y. Dang Fahimeh 8.2 8.7 April 21, 2015 Context 8.2. Convex sets 8.3. Describing a bounded polyhedron 8.4. Describing unbounded polyhedron 8.5. Faces,
More informationarxiv: v1 [math.co] 25 Sep 2015
A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff
More informationSemistandard Young Tableaux Polytopes. Sara Solhjem Joint work with Jessica Striker. April 9, 2017
Semistandard Young Tableaux Polytopes Sara Solhjem Joint work with Jessica Striker North Dakota State University Graduate Student Combinatorics Conference 217 April 9, 217 Sara Solhjem (NDSU) Semistandard
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationAlgebraic Graph Theory
Chris Godsil Gordon Royle Algebraic Graph Theory With 120 Illustrations Springer Preface 1 Graphs 1 1.1 Graphs 1 1.2 Subgraphs 3 1.3 Automorphisms 4 1.4 Homomorphisms 6 1.5 Circulant Graphs 8 1.6 Johnson
More informationShellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem
Chapter 8 Shellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem 8.1 Shellings The notion of shellability is motivated by the desire to give an inductive
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 1 Why LP? Linear programming (LP, also called linear
More informationConvex sets and convex functions
Convex sets and convex functions Convex optimization problems Convex sets and their examples Separating and supporting hyperplanes Projections on convex sets Convex functions, conjugate functions ECE 602,
More informationConvex sets and convex functions
Convex sets and convex functions Convex optimization problems Convex sets and their examples Separating and supporting hyperplanes Projections on convex sets Convex functions, conjugate functions ECE 602,
More informationThe convex geometry of inverse problems
The convex geometry of inverse problems Benjamin Recht Department of Computer Sciences University of Wisconsin-Madison Joint work with Venkat Chandrasekaran Pablo Parrilo Alan Willsky Linear Inverse Problems
More informationTHE HYPERDETERMINANT AND TRIANGULATIONS OF THE 4-CUBE
MATHEMATICS OF COMPUTATION Volume 77, Number 263, July 2008, Pages 1653 1679 S 0025-5718(08)02073-5 Article electronically published on February 4, 2008 THE HYPERDETERMINANT AND TRIANGULATIONS OF THE 4-CUBE
More informationConvex Optimization Euclidean Distance Geometry 2ε
Convex Optimization Euclidean Distance Geometry 2ε 1 Overview 19 2 Convex geometry 31 2.1 Convex set.................................... 31 2.2 Vectorized-matrix inner product........................ 42
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationEXPERIENCING GEOMETRY
EXPERIENCING GEOMETRY EUCLIDEAN AND NON-EUCLIDEAN WITH HISTORY THIRD EDITION David W. Henderson Daina Taimina Cornell University, Ithaca, New York PEARSON Prentice Hall Upper Saddle River, New Jersey 07458
More informationL-CONVEX-CONCAVE SETS IN REAL PROJECTIVE SPACE AND L-DUALITY
MOSCOW MATHEMATICAL JOURNAL Volume 3, Number 3, July September 2003, Pages 1013 1037 L-CONVEX-CONCAVE SETS IN REAL PROJECTIVE SPACE AND L-DUALITY A. KHOVANSKII AND D. NOVIKOV Dedicated to Vladimir Igorevich
More informationIntroduction to Algorithms Third Edition
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction
More informationLattice-point generating functions for free sums of polytopes
Lattice-point generating functions for free sums of polytopes Tyrrell B. McAllister 1 Joint work with Matthias Beck 2 and Pallavi Jayawant 3 1 University of Wyoming 2 San Francisco State University 3 Bates
More informationOn the null space of a Colin de Verdière matrix
On the null space of a Colin de Verdière matrix László Lovász 1 and Alexander Schrijver 2 Dedicated to the memory of François Jaeger Abstract. Let G = (V, E) be a 3-connected planar graph, with V = {1,...,
More information13. Cones and semidefinite constraints
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 13. Cones and semidefinite constraints ˆ Geometry of cones ˆ Second order cone programs ˆ Example: robust linear program ˆ Semidefinite constraints
More informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationLecture 1 Discrete Geometric Structures
Lecture 1 Discrete Geometric Structures Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology
More informationarxiv: v1 [math.gr] 19 Dec 2018
GROWTH SERIES OF CAT(0) CUBICAL COMPLEXES arxiv:1812.07755v1 [math.gr] 19 Dec 2018 BORIS OKUN AND RICHARD SCOTT Abstract. Let X be a CAT(0) cubical complex. The growth series of X at x is G x (t) = y V
More informationarxiv: v1 [math.co] 12 Dec 2017
arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing
More informationINTRODUCTION TO LINEAR AND NONLINEAR PROGRAMMING
INTRODUCTION TO LINEAR AND NONLINEAR PROGRAMMING DAVID G. LUENBERGER Stanford University TT ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California London Don Mills, Ontario CONTENTS
More informationMinimum norm points on polytope boundaries
Minimum norm points on polytope boundaries David Bremner UNB December 20, 2013 Joint work with Yan Cui, Zhan Gao David Bremner (UNB) Minimum norm facet December 20, 2013 1 / 27 Outline 1 Notation 2 Maximum
More informationarxiv: v1 [math.co] 15 Dec 2009
ANOTHER PROOF OF THE FACT THAT POLYHEDRAL CONES ARE FINITELY GENERATED arxiv:092.2927v [math.co] 5 Dec 2009 VOLKER KAIBEL Abstract. In this note, we work out a simple inductive proof showing that every
More informationGeometric Algorithms in Three Dimensions Tutorial. FSP Seminar, Strobl,
Geometric Algorithms in Three Dimensions Tutorial FSP Seminar, Strobl, 22.06.2006 Why Algorithms in Three and Higher Dimensions Which algorithms (convex hulls, triangulations etc.) can be generalized to
More informationCS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm Instructor: Shaddin Dughmi Outline 1 Recapping the Ellipsoid Method 2 Complexity of Convex Optimization
More informationAMS : Combinatorial Optimization Homework Problems - Week V
AMS 553.766: Combinatorial Optimization Homework Problems - Week V For the following problems, A R m n will be m n matrices, and b R m. An affine subspace is the set of solutions to a a system of linear
More informationNeighborly Embedded Manifolds
DOI 10.1007/s00454-008-9065-y Neighborly Embedded Manifolds G. Kalai A. Wigderson Received: 11 May 2007 / Revised: 19 October 2007 Springer Science+Business Media, LLC 2008 Abstract An embedding of an
More informationOutreach Lecture: Polytopes
Outreach Lecture: Polytopes Darrell Allgaier (Grove City College), David Perkinson (Reed College), Sarah Ann Stewart (North Central College), John Thurber (Eastern Oregon University) Abstract This is an
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationCombinatorial Aspects of Convex Polytopes
Combinatorial Aspects of Convex Polytopes Margaret M. Bayer 1 Department of Mathematics University of Kansas Carl W. Lee 2 Department of Mathematics University of Kentucky August 1, 1991 Chapter for Handbook
More informationLecture 4: Rational IPs, Polyhedron, Decomposition Theorem
IE 5: Integer Programming, Spring 29 24 Jan, 29 Lecture 4: Rational IPs, Polyhedron, Decomposition Theorem Lecturer: Karthik Chandrasekaran Scribe: Setareh Taki Disclaimer: These notes have not been subjected
More informationPolyhedral Computation Today s Topic: The Double Description Algorithm. Komei Fukuda Swiss Federal Institute of Technology Zurich October 29, 2010
Polyhedral Computation Today s Topic: The Double Description Algorithm Komei Fukuda Swiss Federal Institute of Technology Zurich October 29, 2010 1 Convexity Review: Farkas-Type Alternative Theorems Gale
More informationEdge unfolding Cut sets Source foldouts Proof and algorithm Complexity issues Aleksandrov unfolding? Unfolding polyhedra.
Unfolding polyhedra Ezra Miller University of Minnesota ezra@math.umn.edu University of Nebraska 27 April 2007 Outline 1. Edge unfolding 2. Cut sets 3. Source foldouts 4. Proof and algorithm 5. Complexity
More informationLecture: Convex Sets
/24 Lecture: Convex Sets http://bicmr.pku.edu.cn/~wenzw/opt-27-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/24 affine and convex sets some
More informationCAT(0)-spaces. Münster, June 22, 2004
CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan
More informationREGULAR POLYTOPES REALIZED OVER Q
REGULAR POLYTOPES REALIZED OVER Q TREVOR HYDE A regular polytope is a d-dimensional generalization of a regular polygon and a Platonic solid. Roughly, they are convex geometric objects with maximal rotational
More informationCOM Optimization for Communications Summary: Convex Sets and Convex Functions
1 Convex Sets Affine Sets COM524500 Optimization for Communications Summary: Convex Sets and Convex Functions A set C R n is said to be affine if A point x 1, x 2 C = θx 1 + (1 θ)x 2 C, θ R (1) y = k θ
More informationThe convex geometry of inverse problems
The convex geometry of inverse problems Benjamin Recht Department of Computer Sciences University of Wisconsin-Madison Joint work with Venkat Chandrasekaran Pablo Parrilo Alan Willsky Linear Inverse Problems
More informationBasis Enumeration of Hyperplane Arrangements Up to Symmetries
CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 Basis Enumeration of Hyperplane Arrangements Up to Symmetries Aaron Moss David Bremner Abstract Given a symmetry group acting on the hyperplanes of an
More information