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

Electrical Engineering Stanford University 3.0 credits

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

Reviews

Sign in to Review Login to Review

No reviews yet. Be the first to share your experience!

Sign in with Google Login to Review