Teaching

CSE 535 Theory of Optimization and Continuous Algorithms

Winter 2019

This course covers several concepts in convex optimization, including, Reduction, elimination, conditioning, geometrization, expansion, sparsification, acceleration, and decomposition.

CSE 421 Introduction to Algorithms

Autumn 2018

This course covers a range of design and analysis techniques including greedy methods, divide and conquer, and dynamic programming. It also discusses the maximum flow problem and NP-completeness.

CSE 421 Introduction to Algorithms

Spring 2018

This course covers a range of design and analysis techniques including greedy methods, divide and conquer, and dynamic programming. It also discusses the maximum flow problem and NP-completeness.

CSE 599 Interplay between Convex Optimization and Geometry

Winter 2018

This course covers several frameworks for convex optimization, including, first-order methods, cutting plane methods and interior point methods.