ee227c.github.io - EE 227C (Spring 2018) Convex Optimization and Approximation

Description: EE227C (Spring 2018) Course page

Example domain paragraphs

University of California, Berkeley

Time: TuTh 12:30PM - 1:59PM , Location: Etcheverry 3106 Instructor: Moritz Hardt (Email: hardt+ee227c@berk…edu) Graduate Instructor: Max Simchowitz (Email: msimchow@berk…edu). Office hours: Max on Mon 3-4pm, Soda 310 (starting 1/29), Moritz on Fri 9–9:50a, SDH 722

This course will explore theory and algorithms for nonlinear optimization. We will focus on problems that arise in machine learning and modern data analysis, paying attention to concerns about complexity, robustness, and implementation in these domains. We will also see how tools from convex optimization can help tackle non-convex optimization problems common in practice.

Links to ee227c.github.io (5)

mrtz.org Moritz Hardt
msimchowitz.github.io Max Simchowitz
cs4540-f18.github.io Course Info | CS 4540 F18
cs4540-f19.github.io CS 4540 F19 | Advanced Algorithms @ Georgia Tech
1five9.github.io CS159 - Home