Large-Scale Convex Optimization: Algorithms and Analyses via Monotone Operators

3 credits · Graduate

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