Convexity and Optimization – Part I
Recension :
( 0 )
216 pages
This book contains everything you need to know about convexity in order to get a thorough understanding of linear and convex optimization.
Det här är en gratis eBok för studerande
Skapa ett konto för gratis åtkomst
Alla läroböcker är gratis - för alltid. Mindre än 15 % reklam.
Prova gratis i 30 dagar
Business-prenumeration gratis de första 30 dagarna, sedan $5.99/månad
Senast tillagda
Om författaren

Lars-Åke Lindahl obtained his mathematical education at Uppsala University and Institut Mittag-Leffler and got a Ph.D. in Mathematics in 1971 with a thesis on Harmonic Analysis. Shortly thereafter he was employed as senior lecturer in Mathematics at Uppsala University, where he remained until his reti...


Convexity plays an important role in many areas of Mathematics, and this book, the first in a series of three on Convexity and Optimization, studies this concept in detail.

The first half of the book is about convex sets. Convex hull, convex cones, separation by hyperplanes, extreme points, faces, and extreme rays are some of the important notions that are considered. Results for the dual cone are interpreted as solvability criteria for systems of linear inequalities. Closed convex sets in general and polyhedra in particular are characterized in terms of extreme points and extreme rays.

The second half is about convex functions. We study, among other things, convexity preserving operations, maxima and minima of convex functions, continuity and differentiability properties, subdifferentials, and conjugate functions.

The book requires knowledge of Linear Algebra and Calculus of Several Variables.

  1. Preliminaries
  2. Convex sets
    1. Affine sets and affine maps
    2. Convex sets
    3. Convexity preserving operations
    4. Convex hull
    5. Topological properties
    6. Cones
    7. The recession cone
  3. Separation
    1. Separating hyperplanes
    2. The dual cone
    3. Solvability of systems of linear inequalities
  4. More on convex sets
    1. Extreme points and faces
    2. Structure theorems for convex sets
  5. Polyhedra
    1. Extreme points and extreme rays
    2. Polyhedral cones
    3. The internal structure of polyhedra
    4. Polyhedron preserving operations
    5. Separation
  6. Convex functions
    1. Basic definitions
    2. Operations that preserve convexity
    3. Maximum and minimum
    4. Some important inequalities
    5. Solvability of systems of convex inequalities
    6. Continuity
    7. The recessive subspace of convex functions
    8. Closed convex functions
    9. The support function
    10. The Minkowski functional
  7. Smooth convex functions
    1. Convex functions on R
    2. Differentiable convex functions
    3. Strong convexity
    4. Convex functions with Lipschitz continuous derivatives
  8. The subdifferential
    1. The subdifferential
    2. Closed convex functions
    3. The conjugate function
    4. The direction derivative
    5. Subdifferentiation rules