Continuous optimization is a key component of modern data analysis. Recently, the demands
of extremely large-scale applications have shifted the focus from high cost, high accuracy
methods to low…

We give an efficient algorithm for computing a Cournot equilibrium when the producers are confined to integers, the inverse demand function is linear, and costs are quadratic. The method also…

A great success of the 20th century was the development of fast transforms such
as the fast Fourier transform, the fast multipole method, and butterfly algorithms. In
this talk we carefully employ…

Variational analysis has come of age. Long an elegant theoretical toolkit for variational mathematics and nonsmooth optimization, it now increasingly underpins the study of algorithms, and a rich…

Wednesday, March 26, 2014 at 3:00pm
Frank H. T. Rhodes Hall, 253
ORIE Colloquium: Stefanie Jegelka (UC Berkeley) - Efficient learning with combinatorial structure
Learning from complex data such as…

Tuesday, March 25, 2014 at 4:15pm
Frank H. T. Rhodes Hall, 253
ORIE Colloquium: Rob Freund (MIT) - A First-Order View of Some Boosting Methods: Computational Guarantees and Connections to…

Thursday, February 6, 2014 at 4:15pm
Frank H. T. Rhodes Hall, 253
ORIE Colloquium: Po-Ling Loh (Cal-Berkeley) - Nonconvex Methods for High-Dimensional Regression with Noisy and Missing Data
Noisy and…