A Course in Convexity

Author: Alexander Barvinok

Publisher: American Mathematical Soc.

ISBN: 0821829688

Category: Mathematics

Page: 366

View: 5599

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.

Pattern Recognition on Oriented Matroids

Author: Andrey O. Matveev

Publisher: Walter de Gruyter GmbH & Co KG

ISBN: 3110531143

Category: Mathematics

Page: 231

View: 3797

Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities – the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon. The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs. Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn–Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs

Combinatorial Algebraic Geometry

Selected Papers From the 2016 Apprenticeship Program

Author: Gregory G. Smith,Bernd Sturmfels

Publisher: Springer

ISBN: 1493974866

Category: Mathematics

Page: 390

View: 7600

This volume consolidates selected articles from the 2016 Apprenticeship Program at the Fields Institute, part of the larger program on Combinatorial Algebraic Geometry that ran from July through December of 2016. Written primarily by junior mathematicians, the articles cover a range of topics in combinatorial algebraic geometry including curves, surfaces, Grassmannians, convexity, abelian varieties, and moduli spaces. This book bridges the gap between graduate courses and cutting-edge research by connecting historical sources, computation, explicit examples, and new results.

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization

Author: Levent Tunçel

Publisher: American Mathematical Soc.

ISBN: 1470428113


Page: 219

View: 7797

Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric representations of graphs, semidefinite programming techniques yield important new results. This monograph provides the necessary background to work with semidefinite optimization techniques, usually by drawing parallels to the development of polyhedral techniques and with a special focus on combinatorial optimization, graph theory and lift-and-project methods. It allows the reader to rigorously develop the necessary knowledge, tools and skills to work in the area that is at the intersection of combinatorial optimization and semidefinite optimization. A solid background in mathematics at the undergraduate level and some exposure to linear optimization are required. Some familiarity with computational complexity theory and the analysis of algorithms would be helpful. Readers with these prerequisites will appreciate the important open problems and exciting new directions as well as new connections to other areas in mathematical sciences that the book provides.

Handbook on Semidefinite, Conic and Polynomial Optimization

Author: Miguel F. Anjos,Jean B. Lasserre

Publisher: Springer Science & Business Media

ISBN: 1461407699

Category: Business & Economics

Page: 960

View: 2842

Semidefinite and conic optimization is a major and thriving research area within the optimization community. Although semidefinite optimization has been studied (under different names) since at least the 1940s, its importance grew immensely during the 1990s after polynomial-time interior-point methods for linear optimization were extended to solve semidefinite optimization problems. Since the beginning of the 21st century, not only has research into semidefinite and conic optimization continued unabated, but also a fruitful interaction has developed with algebraic geometry through the close connections between semidefinite matrices and polynomial optimization. This has brought about important new results and led to an even higher level of research activity. This Handbook on Semidefinite, Conic and Polynomial Optimization provides the reader with a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization, and polynomial optimization. It contains a compendium of the recent research activity that has taken place in these thrilling areas, and will appeal to doctoral students, young graduates, and experienced researchers alike. The Handbook’s thirty-one chapters are organized into four parts: Theory, covering significant theoretical developments as well as the interactions between conic optimization and polynomial optimization; Algorithms, documenting the directions of current algorithmic development; Software, providing an overview of the state-of-the-art; Applications, dealing with the application areas where semidefinite and conic optimization has made a significant impact in recent years.

Dense Sphere Packings

A Blueprint for Formal Proofs

Author: Thomas Hales

Publisher: Cambridge University Press

ISBN: 113957647X

Category: Mathematics

Page: N.A

View: 2429

The 400-year-old Kepler conjecture asserts that no packing of congruent balls in three dimensions can have a density exceeding the familiar pyramid-shaped cannonball arrangement. In this book, a new proof of the conjecture is presented that makes it accessible for the first time to a broad mathematical audience. The book also presents solutions to other previously unresolved conjectures in discrete geometry, including the strong dodecahedral conjecture on the smallest surface area of a Voronoi cell in a sphere packing. This book is also currently being used as a blueprint for a large-scale formal proof project, which aims to check every logical inference of the proof of the Kepler conjecture by computer. This is an indispensable resource for those who want to be brought up to date with research on the Kepler conjecture.

Convexity and Optimization in Rn

Author: Leonard D. Berkovitz

Publisher: John Wiley & Sons

ISBN: 0471461660

Category: Mathematics

Page: 280

View: 7001

A comprehensive introduction to convexity and optimization inRn This book presents the mathematics of finite dimensionalconstrained optimization problems. It provides a basis for thefurther mathematical study of convexity, of more generaloptimization problems, and of numerical algorithms for the solutionof finite dimensional optimization problems. For readers who do nothave the requisite background in real analysis, the author providesa chapter covering this material. The text features abundantexercises and problems designed to lead the reader to a fundamentalunderstanding of the material. Convexity and Optimization in Rn provides detailed discussionof: * Requisite topics in real analysis * Convex sets * Convex functions * Optimization problems * Convex programming and duality * The simplex method A detailed bibliography is included for further study and an indexoffers quick reference. Suitable as a text for both graduate andundergraduate students in mathematics and engineering, thisaccessible text is written from extensively class-tested notes.

A Course in Robust Control Theory

A Convex Approach

Author: Geir E. Dullerud,Fernando Paganini

Publisher: Springer Science & Business Media

ISBN: 1475732902

Category: Mathematics

Page: 419

View: 6642

During the 90s robust control theory has seen major advances and achieved a new maturity, centered around the notion of convexity. The goal of this book is to give a graduate-level course on this theory that emphasizes these new developments, but at the same time conveys the main principles and ubiquitous tools at the heart of the subject. Its pedagogical objectives are to introduce a coherent and unified framework for studying the theory, to provide students with the control-theoretic background required to read and contribute to the research literature, and to present the main ideas and demonstrations of the major results. The book will be of value to mathematical researchers and computer scientists, graduate students planning to do research in the area, and engineering practitioners requiring advanced control techniques.

Linear Algebra in Action

Second Edition

Author: Harry Dym

Publisher: American Mathematical Soc.

ISBN: 1470409089

Category: Mathematics

Page: 585

View: 1186

Linear algebra permeates mathematics, perhaps more so than any other single subject. It plays an essential role in pure and applied mathematics, statistics, computer science, and many aspects of physics and engineering. This book conveys in a user-friendly way the basic and advanced techniques of linear algebra from the point of view of a working analyst. The techniques are illustrated by a wide sample of applications and examples that are chosen to highlight the tools of the trade. In short, this is material that many of us wish we had been taught as graduate students. Roughly the first third of the book covers the basic material of a first course in linear algebra. The remaining chapters are devoted to applications drawn from vector calculus, numerical analysis, control theory, complex analysis, convexity and functional analysis. In particular, fixed point theorems, extremal problems, matrix equations, zero location and eigenvalue location problems, and matrices with nonnegative entries are discussed. Appendices on useful facts from analysis and supplementary information from complex function theory are also provided for the convenience of the reader. In this new edition, most of the chapters in the first edition have been revised, some extensively. The revisions include changes in a number of proofs, either to simplify the argument, to make the logic clearer or, on occasion, to sharpen the result. New introductory sections on linear programming, extreme points for polyhedra and a Nevanlinna-Pick interpolation problem have been added, as have some very short introductory sections on the mathematics behind Google, Drazin inverses, band inverses and applications of SVD together with a number of new exercises.

Wolf Prize in Mathematics

Author: Shiing-Shen Chern,Friedrich Hirzebruch

Publisher: World Scientific

ISBN: 9789810239459

Category: Mathematics

Page: 761

View: 638



Author: Elliott H. Lieb,Michael Loss

Publisher: American Mathematical Soc.

ISBN: 0821827839

Category: Mathematics

Page: 346

View: 9532

This is an excellent textbook on analysis and it has several unique features: Proofs of heat kernel estimates, the Nash inequality and the logarithmic Sobolev inequality are topics that are seldom treated on the level of a textbook. Best constants in several inequalities, such as Young's inequality and the logarithmic Sobolev inequality, are also included. A thorough treatment of rearrangement inequalities and competing symmetries appears in book form for the first time. There is an extensive treatment of potential theory and its applications to quantum mechanics, which, again, is unique at this level. Uniform convexity of $L^p$ space is treated very carefully. The presentation of this important subject is highly unusual for a textbook. All the proofs provide deep insights into the theorems. This book sets a new standard for a graduate textbook in analysis. --Shing-Tung Yau, Harvard University For some number of years, Rudin's ``Real and Complex'', and a few other analysis books, served as the canonical choice for the book to use, and to teach from, in a first year grad analysis course. Lieb-Loss offers a refreshing alternative: It begins with a down-to-earth intro to measure theory, $L^p$ and all that ... It aims at a wide range of essential applications, such as the Fourier transform, and series, inequalities, distributions, and Sobolev spaces--PDE, potential theory, calculus of variations, and math physics (Schrodinger's equation, the hydrogen atom, Thomas-Fermi theory ... to mention a few). The book should work equally well in a one-, or in a two-semester course. The first half of the book covers the basics, and the rest will be great for students to have, regardless of whether or not it gets to be included in a course. --Palle E. T. Jorgensen, University of Iowa

Topics in Optimal Transportation

Author: Cédric Villani

Publisher: American Mathematical Soc.

ISBN: 082183312X

Category: Mathematics

Page: 370

View: 8545

Cedric Villani's book is a lucid and very readable documentation of the tremendous recent analytic progress in ``optimal mass transportation'' theory and of its diverse and unexpected applications in optimization, nonlinear PDE, geometry, and mathematical physics. --Lawrence C. Evans, University of California at Berkeley In 1781, Gaspard Monge defined the problem of ``optimal transportation'', or the transferring of mass with the least possible amount of work, with applications to engineering in mind. In 1942, Leonid Kantorovich applied the newborn machinery of linear programming to Monge's problem, with applications to economics in mind. In 1987, Yann Brenier used optimal transportation to prove a new projection theorem on the set of measure preserving maps, with applications to fluid mechanics in mind. Each of these contributions marked the beginning of a whole mathematical theory, with many unexpected ramifications. Nowadays, the Monge-Kantorovich problem is used and studied by researchers from extremely diverse horizons, including probability theory, functional analysis, isoperimetry, partial differential equations, and even meteorology. Originating from a graduate course, the present volume is at once an introduction to the field of optimal transportation and a survey of the research on the topic over the last 15 years. The book is intended for graduate students and researchers, and it covers both theory and applications. Readers are only assumed to be familiar with the basics of measure theory and functional analysis.


Author: N.A

Publisher: N.A


Category: Mathematics

Page: N.A

View: 8943


Mathematical Methods and Models for Economists

Author: Angel de la Fuente

Publisher: Cambridge University Press

ISBN: 9780521585293

Category: Business & Economics

Page: 835

View: 7855

A textbook for a first-year PhD course in mathematics for economists and a reference for graduate students in economics.

General Equilibrium Theory

An Introduction

Author: Ross M. Starr

Publisher: Cambridge University Press

ISBN: 9780521564731

Category: Business & Economics

Page: 250

View: 2280

General Equilibrium Theory: An Introduction presents to students general equilibrium analysis.