A Course in Convexity
A Course in Convexity

Author: Alexander Barvinok

Publisher: American Mathematical Soc.

Published: 2002-11-19

Total Pages: 378

ISBN-13: 0821829688

DOWNLOAD EBOOK

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.

Convexity and Optimization in Rn
Convexity and Optimization in Rn

Author: Leonard D. Berkovitz

Publisher: John Wiley & Sons

Published: 2003-04-14

Total Pages: 283

ISBN-13: 0471461660

DOWNLOAD EBOOK

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.

Convexity
Convexity

Author: Barry Simon

Publisher: Cambridge University Press

Published: 2011-05-19

Total Pages: 357

ISBN-13: 1139497596

DOWNLOAD EBOOK

Convexity is important in theoretical aspects of mathematics and also for economists and physicists. In this monograph the author provides a comprehensive insight into convex sets and functions including the infinite-dimensional case and emphasizing the analytic point of view. Chapter one introduces the reader to the basic definitions and ideas that play central roles throughout the book. The rest of the book is divided into four parts: convexity and topology on infinite-dimensional spaces; Loewner's theorem; extreme points of convex sets and related issues, including the Krein–Milman theorem and Choquet theory; and a discussion of convexity and inequalities. The connections between disparate topics are clearly explained, giving the reader a thorough understanding of how convexity is useful as an analytic tool. A final chapter overviews the subject's history and explores further some of the themes mentioned earlier. This is an excellent resource for anyone interested in this central topic.

Geometry and Convexity
Geometry and Convexity

Author: Paul J. Kelly

Publisher:

Published: 2009

Total Pages: 0

ISBN-13: 9780486469805

DOWNLOAD EBOOK

This text assumes no prerequisites, offering an easy-to-read treatment with simple notation and clear, complete proofs. From motivation to definition, its explanations feature concrete examples and theorems. 1979 edition.

Convexity
Convexity

Author: H. G. Eggleston

Publisher: CUP Archive

Published: 1958

Total Pages: 160

ISBN-13: 9780521077347

DOWNLOAD EBOOK

This account of convexity includes the basic properties of convex sets in Euclidean space and their applications, the theory of convex functions and an outline of the results of transformations and combinations of convex sets. It will be useful for those concerned with the many applications of convexity in economics, the theory of games, the theory of functions, topology, geometry and the theory of numbers.

Complex Convexity and Analytic Functionals
Complex Convexity and Analytic Functionals

Author: Mats Andersson

Publisher: Birkhäuser

Published: 2012-12-06

Total Pages: 172

ISBN-13: 3034878710

DOWNLOAD EBOOK

This book puts the modern theory of complex linear convexity on a solid footing, and gives a thorough and up-to-date survey of its current status. Applications include the Fantappié transformation of analytic functionals, integral representation formulas, polynomial interpolation, and solutions to linear partial differential equations.

Generalized Convexity and Optimization
Generalized Convexity and Optimization

Author: Alberto Cambini

Publisher: Springer Science & Business Media

Published: 2008-10-14

Total Pages: 252

ISBN-13: 3540708766

DOWNLOAD EBOOK

The authors have written a rigorous yet elementary and self-contained book to present, in a unified framework, generalized convex functions. The book also includes numerous exercises and two appendices which list the findings consulted.

Convexity and Well-Posed Problems
Convexity and Well-Posed Problems

Author: Roberto Lucchetti

Publisher: Springer Science & Business Media

Published: 2006-02-02

Total Pages: 308

ISBN-13: 0387310827

DOWNLOAD EBOOK

This book deals mainly with the study of convex functions and their behavior from the point of view of stability with respect to perturbations. We shall consider convex functions from the most modern point of view: a function is de?ned to be convex whenever its epigraph, the set of the points lying above the graph, is a convex set. Thus many of its properties can be seen also as properties of a certain convex set related to it. Moreover, we shall consider extended real valued functions, i. e. , functions taking possibly the values?? and +?. The reason for considering the value +? is the powerful device of including the constraint set of a constrained minimum problem into the objective function itself (by rede?ning it as +? outside the constraint set). Except for trivial cases, the minimum value must be taken at a point where the function is not +?, hence at a point in the constraint set. And the value ?? is allowed because useful operations, such as the inf-convolution, can give rise to functions valued?? even when the primitive objects are real valued. Observe that de?ning the objective function to be +? outside the closed constraint set preserves lower semicontinuity, which is the pivotal and mi- mal continuity assumption one needs when dealing with minimum problems. Variational calculus is usually based on derivatives.

Notions of Convexity
Notions of Convexity

Author: Lars Hörmander

Publisher: Springer Science & Business Media

Published: 2007-06-25

Total Pages: 424

ISBN-13: 0817645853

DOWNLOAD EBOOK

The first two chapters of this book are devoted to convexity in the classical sense, for functions of one and several real variables respectively. This gives a background for the study in the following chapters of related notions which occur in the theory of linear partial differential equations and complex analysis such as (pluri-)subharmonic functions, pseudoconvex sets, and sets which are convex for supports or singular supports with respect to a differential operator. In addition, the convexity conditions which are relevant for local or global existence of holomorphic differential equations are discussed.