A Course in ConvexityAmerican Mathematical Society, 06.05.2025 - 366 Seiten Convexity is a simple idea that manifests itself in a surprising variety of places. This fertile field has an immensely rich structure and numerous applications. Barvinok demonstrates that simplicity, intuitive appeal, and the universality of applications make teaching (and learning) convexity a gratifying experience. The book will benefit both teacher and student: It is easy to understand, entertaining to the reader, and includes many exercises that vary in degree of difficulty. Overall, the author demonstrates the power of a few simple unifying principles in a variety of pure and applied problems. The prerequisites are minimal amounts of linear algebra, analysis, and elementary topology, plus basic computational skills. Portions of the book could be used by advanced undergraduates. As a whole, it is designed for graduate students interested in mathematical methods, computer science, electrical engineering, and operations research. The book will also be of interest to research mathematicians, who will find some results that are recent, some that are new, and many known results that are discussed from a new perspective. |
Inhalt
| 1 | |
Chapter II Faces and Extreme Points | 41 |
Chapter III Convex Sets in Topological Vector Spaces | 105 |
Chapter IV Polarity Duality and Linear Programming | 143 |
Chapter V Convex Bodies and Ellipsoids | 203 |
Chapter VI Faces of Polytopes | 249 |
Chapter VII Lattices and Convex Bodies | 279 |
Chapter VIII Lattice Points and Polyhedra | 325 |
Bibliography | 357 |
| 363 | |
Back Cover | 367 |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
A₁ affine hull affine hyperplane affine subspace algebraically open closed convex set compact convex set containing convex body convex combination convex cone convex hull convex set Corollary d-dimensional polytope dual optimal plan E₁ equations Euclidean space exists extreme point F₁ face F facets finite follows function f halfspaces Helly's Theorem Hence Hint hyperplane H indicator functions interior intersection interval K₁ KC Rd lattice and let lattice point Lemma Let AC Rd Let us choose Let us consider Let us define Let us fix linear programming linear transformation matrix non-empty non-negative non-zero open set orthogonal PC Rd polyhedra polyhedron polynomial positive integer primal optimal plan Proof Proposition Prove Rd+1 real numbers Section simple polytope solution space and let straight line subset Suppose symmetric Theorem topological vector space u₁ vertex vertices ξα ξο
