Understanding and Using Linear Programming

Author: Jiri Matousek,Bernd Gärtner

Publisher: Springer Science & Business Media

ISBN: 3540307176

Category: Mathematics

Page: 226

View: 3332

DOWNLOAD NOW »

The book is an introductory textbook mainly for students of computer science and mathematics. Our guiding phrase is "what every theoretical computer scientist should know about linear programming". A major focus is on applications of linear programming, both in practice and in theory. The book is concise, but at the same time, the main results are covered with complete proofs and in sufficient detail, ready for presentation in class. The book does not require more prerequisites than basic linear algebra, which is summarized in an appendix. One of its main goals is to help the reader to see linear programming "behind the scenes".
Release

Approximation Algorithms and Semidefinite Programming

Author: Bernd Gärtner,Jiri Matousek

Publisher: Springer Science & Business Media

ISBN: 3642220150

Category: Mathematics

Page: 251

View: 3721

DOWNLOAD NOW »

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
Release

Triangulations

Structures for Algorithms and Applications

Author: Jesus De Loera,Joerg Rambau,Francisco Santos

Publisher: Springer Science & Business Media

ISBN: 9783642129711

Category: Mathematics

Page: 535

View: 8667

DOWNLOAD NOW »

Triangulations presents the first comprehensive treatment of the theory of secondary polytopes and related topics. The text discusses the geometric structure behind the algorithms and shows new emerging applications, including hundreds of illustrations, examples, and exercises.
Release

The Multivariate Algorithmic Revolution and Beyond

Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday

Author: Hans L. Bodlaender,Rodney Downey,Fedor V. Fomin,Dániel Marx

Publisher: Springer

ISBN: 3642308910

Category: Computers

Page: 506

View: 9189

DOWNLOAD NOW »

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift has been published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field.
Release

Geometric Methods and Applications

For Computer Science and Engineering

Author: Jean Gallier

Publisher: Springer Science & Business Media

ISBN: 9781441999610

Category: Mathematics

Page: 680

View: 5058

DOWNLOAD NOW »

This book is an introduction to the fundamental concepts and tools needed for solving problems of a geometric nature using a computer. It attempts to fill the gap between standard geometry books, which are primarily theoretical, and applied books on computer graphics, computer vision, robotics, or machine learning. This book covers the following topics: affine geometry, projective geometry, Euclidean geometry, convex sets, SVD and principal component analysis, manifolds and Lie groups, quadratic optimization, basics of differential geometry, and a glimpse of computational geometry (Voronoi diagrams and Delaunay triangulations). Some practical applications of the concepts presented in this book include computer vision, more specifically contour grouping, motion interpolation, and robot kinematics. In this extensively updated second edition, more material on convex sets, Farkas’s lemma, quadratic optimization and the Schur complement have been added. The chapter on SVD has been greatly expanded and now includes a presentation of PCA. The book is well illustrated and has chapter summaries and a large number of exercises throughout. It will be of interest to a wide audience including computer scientists, mathematicians, and engineers. Reviews of first edition: "Gallier's book will be a useful source for anyone interested in applications of geometrical methods to solve problems that arise in various branches of engineering. It may help to develop the sophisticated concepts from the more advanced parts of geometry into useful tools for applications." (Mathematical Reviews, 2001) "...it will be useful as a reference book for postgraduates wishing to find the connection between their current problem and the underlying geometry." (The Australian Mathematical Society, 2001)
Release

Numerical Optimization

Theoretical and Practical Aspects

Author: Joseph-Frédéric Bonnans,Jean Charles Gilbert,Claude Lemarechal,Claudia A. Sagastizábal

Publisher: Springer Science & Business Media

ISBN: 3662050781

Category: Mathematics

Page: 423

View: 6177

DOWNLOAD NOW »

This book starts with illustrations of the ubiquitous character of optimization, and describes numerical algorithms in a tutorial way. It covers fundamental algorithms as well as more specialized and advanced topics for unconstrained and constrained problems. This new edition contains computational exercises in the form of case studies which help understanding optimization methods beyond their theoretical description when coming to actual implementation.
Release

Linear Programming Duality

An Introduction to Oriented Matroids

Author: Achim Bachem,Walter Kern

Publisher: Springer Science & Business Media

ISBN: 9783540554172

Category: Business & Economics

Page: 218

View: 2359

DOWNLOAD NOW »

Linear Programming Duality is one of the cornerstones in combinatorial optimization. The book is written by two authors who have been working in the field of combinatorial optimization for many years. They give an elementary introduction to the theory of oriented matroids. Their approach clarifies the theoretical basis of Linear Programming and simplifies the proofs of standard results. The book contains numerous figures and the authors have included suggestions for further reading after each chapter.
Release

Algebraic Function Fields and Codes

Author: Henning Stichtenoth

Publisher: Springer Science & Business Media

ISBN: 3540768777

Category: Mathematics

Page: 360

View: 5279

DOWNLOAD NOW »

This book links two subjects: algebraic geometry and coding theory. It uses a novel approach based on the theory of algebraic function fields. Coverage includes the Riemann-Rock theorem, zeta functions and Hasse-Weil's theorem as well as Goppa' s algebraic-geometric codes and other traditional codes. It will be useful to researchers in algebraic geometry and coding theory and computer scientists and engineers in information transmission.
Release