We consider the communication complexity of some fundamental convex optimization
problems in the point-to-point (coordinator) and blackboard communication models. We …

It is an open question to determine if the theory of self-concordant barriers can provide an
interior point method with strongly polynomial complexity in linear programming. In the …

Many fundamental problems in machine learning can be formulated by the convex
program\[\min_ {\theta\in\mathbb {R}^ d}\\sum_ {i= 1}^{n} f_ {i}(\theta),\] where each $ f_i $ is …

Recent work in imitation learning has shown that having an expert controller that is both
suitably smooth and stable enables much stronger guarantees on the performance of the …

Some Problems in Conic, Nonsmooth, and Online Optimization Page 1 Some Problems in
Conic, Nonsmooth, and Online Optimization Swati Padmanabhan A dissertation submitted in …

We give a strongly polynomial algorithm for minimum cost generalized flow, and hence for
optimizing any linear program with at most two non-zero entries per row, or at most two non …