Math 327/427 OPRE 427: Convexity and Optimization

Description
Introduction to the theory of convex sets and functions and to the extremum problems in areas of mathematics
where convexity plays a role.
Among the topics discussed are basic properties of convex sets (extreme points, facial structure of poytopes),
separation theorems, duality and polars, properites of convex functions, mimima and maxima of
convex functions over a convex set, various optimization problems.



Instructor Elisabeth Werner
Office 325 Yost Hall
Phone 368 2901
e-mail elisabeth.werner@case.edu
Home Page http://www.cwru.edu/artsci/math/werner/index.html

Office hours
MW 1:20-2:10, Fr: 2:00-2:50 or by appointment

Text
R. L. Berkovitz: Convexity and Optimization in R^n

Grading
The grades will essentially be determined by homework, quizzes and the final exam
You may not make use of AI composition software (such as ChatGPT) in this course.
Homework problems will be assigned weekly; homework problems will be relevant for the quizzes

total points for quizzes: 200 points
1 final exam or equivalent: 200 points

There will be no make-ups for quizzes. The instructor has to be notified BEFORE the quizz
with a valid reason if the student cannot make it for a quiz.
The dates for the quizzes are (tentatively): September 20, October 18, November 15
Date of final: TBA