This is the course website for the Stanford University course Large-Scale Convex Optimization: Algorithms and Analyses via Monotone Operators (EE 392F), Spring 2022. We will host the discussion forum in Ed.
Weekly homework assignments, due each Friday at midnight, starting the second week. Late homework will not be accepted. You are allowed, even encouraged, to work on the homework in small groups, but you must write up your own homework to hand in. Each question on the homework will be graded on a scale of {0, 1, 2}.
Ernest K. Ryu, Packard 212,
Office hours: Wednesday 12:00–1:20pm
Tuesday and Thursday 12:00–1:20pm at Hewlett Teaching Center Rm 101.
This class will have in-person (non-take-home) hand-written (no computers) midterm and final exams.
Homework 30%, midterm exam 30%, final exam 40%.
EE 364a. Background in (mathematical) analysis is helpful but not necessary.
We will use Large-Scale Convex Optimization: Algorithms and Analyses via Monotone Operators by Ryu (myself) and Yin. You will have access to a free (legal) electronic copy of the book.