CS Department Colloquium Series

Faster algorithms for fundamental convex problems and their applications in combinatorial optimization

Convex optimization has been studied extensively and is a prominent tool in various areas such as combinatorial optimization, data analysis, operations research, and scientific computing.  Each field has developed specialized tools including data structures, sampling methods, and dimension r