| HOUR |
Speaker |
Title |
| 14:00-17:45 | Terlaky (Semi-Plenary) |
On the Curvature of the Central Path and Polytopes: Klee-Minty Constructions, the Hirsh Conjecture and its Relatives |
| 14:50-15:15 | Vandenberghe | Logarithmic barriers for sparse matrix cones |
| 15:15-15:40 | Goldfarb | Fast First-Order and Alternating Direction Methods for Stable Princial Component Pursuit |
| 15:40-16:05 | Caramanis | Robust Matrix Completion and Collaborative Filtering |
| 16:05-16:30 | Renegar | Using Newton's Method to Reoptimize for Hyperbolic Programs |
| 16:30-17:00 | COFFEE BREAK | |
| 17:00-17:25 | Toint | The Cubic Regularization Algorithm and Complexity Issues for Nonconvex Optimization |
| 17:25-17:50 | Cartis | Towards Optimal Newton-Type Methods for Nonconvex Smooth Optimization |
| HOUR |
Speaker |
Title |
| 14:00-14:25 | Lotz | Condition numbers for optimization and compressed sensing threshold |
| 14:25-14:50 | Pataki | Bad semidefinite programs: they all look the same |
| 14:50-15:35 | Guler (Semi-Plenary) |
Second-order conditions in nonlinear optimization |
| 15:40-16:05 | Ahipasaoglu | Convex Relaxations for Subset Selection |
| 16:05-16:30 | Illes | General linear complementarity problems: algorithms and models |
| 16:30-17:00 | COFFEE BREAK | |
| 17:00-17:25 | Roshchina | Invisibility in Billiards and Open Problems in Newtonian Aerodynamics |
| 17:25-17:50 | Todd | A robust robust (sic) optimization result |
| HOUR |
Speaker |
Title |
| 14:00-14:25 | Baes | A randomized Mirror-Prox method for solving structured matrix saddle-point problems |
| 14:25-14:50 | Curtis | Nonsmooth Optimization via Gradient Sampling |
| 14:50-15:15 | Glineur | Convex optimization with a first-order inexact oracle |
| 15:15-15:40 | Recht | Lock-Free Approaches to Parallelizing Stochastic Gradient Descent |
| 15:40-16:05 | Richtarik | Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function. |
| 16:05-16:30 | Pena | A modified perceptron algorithm |
| 16:30-17:00 | COFFEE BREAK | |
| 17:00-17:45 | Nesterov (Semi-Plenary) |
Random gradient-free minimization of convex functions |