Programme HPOPT 2010

To view the abstract please click on the title of the talk. Links to the pdf files of slides and lecture notes are also provided (where available).

Monday June 14^th, 2010

Tutorial day

10:30 – 11:00	Registration and coffee
11:00 – 11:45	Fernando de Oliveira Filho I Tutorial: Randomized rounding procedures for semidenite programming (PART I)
11:45 – 12:30	Fernando de Oliveira Filho II Tutorial: Randomized rounding procedures for semidenite programming (PART II)
12:30 – 14:00	Lunch
14:00 – 14:45	Pablo Parrilo I Tutorial (PART I) Equilibria of games and semidefinite programming
14:45 – 15:30	Pablo Parrilo II Tutorial (PART II) Equilibria of games and semidefinite programming
15:30 – 16:00	Coffee break
16:00 – 16:45	Pablo Parrilo III Tutorial (PART III) Rank/sparsity optimization and matrix decompositions
16:45 – 17:30	Pablo Parrilo IV Tutorial (PART VI) Rank/sparsity optimization and matrix decompositions
17:30 – 19:00	Reception

Tuesday June 15^th, 2010

Invited talks

08:00 – 08:50	Registration and coffee
08:50 – 09:00	Opening
09:00 – 09:45	Mirjam Dür Recent Progress in Copositive Programming
09:45 – 10:30	Franz Rendl Bandwidth, Vertex Separators and Eigenvalue optimization
10:30 – 11:00	Coffee break
11:00 – 11:45	Leonid Gurvits Convex relaxations of mixed derivatives of multivariate entire functions/polynomials
11:45 – 12:30	Yurii Nesterov Efficiency of coordinate descent methods on huge-scale optimization problems (slides)
12:30 – 14:00	Lunch
14:00 – 14:45	Christoph Helmberg Towards Second Order Implementations of the Spectral Bundle Method
14:45 – 15:30	Satyen Kale A Combinatorial, Primal-Dual Approach to Semidefinite Programs
15:30 – 16:00	Coffee break
16:00 – 16:45	Dion Gijswijt New coding bounds using quadruples (slides)
16:45 – 17:30	Frank Vallentin Randomized rounding procedures for semidefinite programming with rank constraints
17:45	Bus departure for Workshop dinner

Wednesday June 16^th, 2010

Invited talks

08:30 – 09:00	Coffee
09:00 – 09:45	Katsuki Fujisawa Fast and stable computation for the Semidefinite Programming
09:45 – 10:30	Masakazu Muramatsu The Facial Reduction Algorithm for Semidefinite Programming Relaxation of Polynomial Optimization Problems (slides)
10:30 – 11:00	Coffee break
11:00 – 11:45	Jean Lasserre A "joint+marginal" algorithm for polynomial optimization (slides)
11:45 – 12:30	Didier Henrion Minimising the sum of many rational functions (slides)
12:30 – 14:00	Lunch
14:00 – 14:45	Chek Beng Chua On a Nonmonotone Class of Semidefinite Complementarity Problems
14:45 – 15:30	Maryam Fazel A Nullspace Analysis of the Nuclear Norm Heuristic for Rank Minimization
15:30 – 15:45	Coffee break
15:45 – 16:30	Rekha Thomas Cone Lifts of Polytopes (slides)
16:30	Closing