Overview

Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples.Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm. Study Guide here

Full Product Details

9789814452762

Table of Contents

Reviews

Overall, the author has managed to keep a sound balance between the different approaches to convexity in geometry, analysis, and applied mathematics. The entire presentation is utmost lucid, didactically well-composed, thematically versatile and essentially self-contained. The large number of instructive examples and illustrating figures will certainly help the unexperienced reader grasp the abstract concepts, methods and results, all of which are treated in a mathematically rigorous way. Also, the emphasis on computational, especially algorithmic methods is a particular feature of this fine undergraduate textbook, which will be a great source for students and instructors like-wise the book under review is an excellent, rather unique primer on convexity in several branches of mathematics. -- Zentralblatt MATH Zentralblatt MATH

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available