World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Undergraduate Convexity cover
Also available at Amazon and Kobo

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

Sample Chapter(s)
Chapter 1: Fourier–Motzkin Elimination (627 KB)


Contents:
  • Fourier–Motzkin Elimination
  • Affine Subspaces
  • Convex Subsets
  • Polyhedra
  • Computations with Polyhedra
  • Closed Convex Subsets and Separating Hyperplanes
  • Convex Functions
  • Differentiable Functions of Several Variables
  • Convex Functions of Several Variables
  • Convex Optimization
  • Appendices:
    • Analysis
    • Linear (In)dependence and the Rank of a Matrix

Readership: Undergraduates focusing on convexity and optimization.