Algebraic And Geometric Ideas In The Theory Of Discrete Optimization
Download Algebraic And Geometric Ideas In The Theory Of Discrete Optimization PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Algebraic And Geometric Ideas In The Theory Of Discrete Optimization book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Algebraic and Geometric Ideas in the Theory of Discrete Optimization
In recent years, many new techniques have emerged in the mathematical theory of discrete optimization that have proven to be effective in solving a number of hard problems. This book presents these recent advances, particularly those that arise from algebraic geometry, commutative algebra, convex and discrete geometry, generating functions, and other tools normally considered outside of the standard curriculum in optimization. These new techniques, all of which are presented with minimal prerequisites, provide a transition from linear to nonlinear discrete optimization. This book can be used as a textbook for advanced undergraduates or first-year graduate students in mathematics, computer science or operations research. It is also appropriate for mathematicians, engineers, and scientists engaged in computation who wish to gain a deeper understanding of how and why algorithms work.
Semidefinite Optimization and Convex Algebraic Geometry
An accessible introduction to convex algebraic geometry and semidefinite optimization. For graduate students and researchers in mathematics and computer science.
Discrete Geometry and Algebraic Combinatorics
Author: Alexander Barg
language: en
Publisher: American Mathematical Society
Release Date: 2014-08-28
This volume contains the proceedings of the AMS Special Session on Discrete Geometry and Algebraic Combinatorics held on January 11, 2013, in San Diego, California. The collection of articles in this volume is devoted to packings of metric spaces and related questions, and contains new results as well as surveys of some areas of discrete geometry. This volume consists of papers on combinatorics of transportation polytopes, including results on the diameter of graphs of such polytopes; the generalized Steiner problem and related topics of the minimal fillings theory; a survey of distance graphs and graphs of diameters, and a group of papers on applications of algebraic combinatorics to packings of metric spaces including sphere packings and topics in coding theory. In particular, this volume presents a new approach to duality in sphere packing based on the Poisson summation formula, applications of semidefinite programming to spherical codes and equiangular lines, new results in list decoding of a family of algebraic codes, and constructions of bent and semi-bent functions.