Large-Scale Convex Optimization: Algorithms and Analyses via Monotone Operators
Lecture
Main Campus
Course Description
This course presents a unified analysis of large-scale convex optimization algorithms through the abstraction of monotone operators. The topics include monotone operators, primal-dual methods, randomized coordinate update methods, ADMM-type methods, maximality, duality, acceleration, scaled relative graphs, and distributed and decentralized optimization
EE 392F
Units: 3
See When It's Offered opens a new window opens in a new tab
Typically Offered
Not Available
Grading Basis
Letter or Credit/No Credit
Class Level
Graduate
Instructional Mode
In Person
Gen Ed Requirement(s)
None