Search Results
EEOR E6616 CONVEX OPTIMIZATION. 3.00 points.
Lect: 2.5.
Prerequisites: (IEOR E6613) and (EEOR E4650)
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
Spring 2022: EEOR E6616
| |||||
Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
---|---|---|---|---|---|
EEOR 6616 | 001/13461 | F 1:10pm - 3:40pm 627 Seeley W. Mudd Building |
Cedric Josz | 3.00 | 25/50 |