| SUNDAY |
| 6:30 |
Dinner, John Davenport's at the Top of the Omni |
| MONDAY |
| 9:15 |
Santosh Vempala (MIT), "Integration and Otimization of High-dimensional Logconcave Functions" |
| 10:00 |
Michael Todd (Cornell), "On Minimum Volume Containing Ellipsoids: From Kiefer and Wolfowitz to Khachiyan and Beyond" |
| 11:15 |
Lisa Fleischer (IBM Watson), "Discrete, Local Tatonnement Algorithms with Polynomial Convergence Properties for Market Equilibrium Problems" |
| 12:00 |
Lunch |
| 1:30 |
Sanjeev Arora (Princeton), "Multiplicative Weight Method: A General Algorithmic Tool (with Applications to Linear and Semidefinite Programming)" |
| 2:15 |
Mihalis Yannakakis (Columbia), "Succinct Approximation of Trade-off Curves" |
| 3:45 |
David Phillips (Columbia), "Strategies for Budget-constrained Auctions" |
| 4:00 |
Dimitris Bertsimas (MIT), "Robust Optimization: A Tractable Approach to Optimization under Uncertainty" |
| 6:30 |
Dinner, The Union League Cafe |
| TUESDAY |
| 9:15 |
Michael Overton (NYU), "Nonsmooth, Nonconvex Optimization: Theory, Algorithms and Applications" |
| 10:00 |
Robert Freund (MIT), " Projective Pre-Conditioners for Improving the Behavior of a Linear or Conic Inequality System" |
| 11:15 |
Farid Alizadeh (Rutgers), "Bilinear Complementary Conditions for the Cone of Positive Polynomials" |
| 12:00 |
Lunch |
| 1:30 |
Elad Hazan (Princeton), "New Techniques in Online Convex Optimization" |
| 2:15 |
David Williamson (Cornell), "A General Approach for Incremental Approximation and Hierarchical Clustering" |
| 3:45 |
Maxim Sviridenko (IBM Watson), "Round and Approx: A New General Method for Multidimensional Packing" |
| 4:15 |
Baruch Schieber (IBM Watson), " Minimizing Setup and Beam-On Times in Radiation Therapy" |