Discrete Convex Analysis
Download Discrete Convex Analysis PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Discrete Convex Analysis 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.
Discrete Convex Analysis
Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis. Discrete Convex Analysis provides the information that professionals in optimization will need to "catch up" with this new theoretical development. It also presents an unexpected connection between matroid theory and mathematical economics and expounds a deeper connection between matrices and matroids than most standard textbooks.
Convex and Discrete Geometry
Author: Peter M. Gruber
language: en
Publisher: Springer Science & Business Media
Release Date: 2007-05-17
Convex and Discrete Geometry is an area of mathematics situated between analysis, geometry and discrete mathematics with numerous relations to other areas. The book gives an overview of major results, methods and ideas of convex and discrete geometry and its applications. Besides being a graduate-level introduction to the field, it is a practical source of information and orientation for convex geometers. It should also be of use to people working in other areas of mathematics and in the applied fields.
Convex Optimization
Author: Stephen P. Boyd
language: en
Publisher: Cambridge University Press
Release Date: 2004-03-08
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.