Spring 2024 Electrical Engineering: Operations Research E6616 section 001

CONVEX OPTIMIZATION

Call Number 11957
Day & Time
Location
F 1:10pm-3:40pm
627 Seeley W. Mudd Building
Points 3
Grading Mode Standard
Approvals Required None
Instructor Cedric Josz
Type LECTURE
Method of Instruction In-Person
Course Description

Convex sets and functions, and operations preserving convexity. Convex optimization problems. Convex duality. Applications of convex optimization problems ranging from signal processing and information theory to revenue management. Convex optimization in Banach spaces. Algorithms for solving constrained convex optimization problems.

Web Site Vergil
Department Industrial Engineering and Operations Research
Enrollment 10 students (50 max) as of 11:07AM Thursday, May 16, 2024
Subject Electrical Engineering: Operations Research
Number E6616
Section 001
Division School of Engineering and Applied Science: Graduate
Campus Morningside
Section key 20241EEOR6616E001