Programme HPOPT 2008

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).

Wednesday June 11^th, 2008

Tutorial day

10:30 – 11:00	Registration and coffee
11:00 – 11:45	Tutorial: Exploiting algebraic symmetry in semidefinite programs: theory and applications (slides) Etienne de Klerk, lecture 1
11:45 – 12:30	Etienne de Klerk, lecture 2
12:30 – 14:00	Lunch
14:00 – 14:45	Tutorial: Semidefinite programs and harmonic analysis (lecture notes) Frank Vallentin, lecture 1
14:45 – 15:30	Frank Vallentin, lecture 2
15:30 – 16:00	Coffee break
16:00 – 16:45	Frank Vallentin, lecture 3
16:45 – 17:30	Frank Vallentin, lecture 4
17:30 – 19:00	Reception

Thursday June 12^th, 2008

Invited talks

08:00 – 08:50	Registration and coffee
08:50 – 09:00	Opening
09:00 – 09:45	J. Lasserre SOS and convexity in polynomial optimization (slides)
09:45 – 10:30	M. Schweighofer Can a system of polynomial inequalities be written as a linear matrix inequality? (slides)
10:30 – 11:00	Coffee break
11:00 – 11:45	Yu. Nesterov Computing the joint spectral radius for some sets of nonnegative matrices (slides)
11:45 – 12:30	A. Nemirovski Tight tractable approximations of chance constrained randomly perturbed LMI's and of quadratic problems with orthogonality constraints (slides)
12:30 – 14:00	Lunch
14:00 – 14:45	L. Tunçel Fundamentals of Convergence Theories for Convex Relaxation Hierarchies (slides)
14:45 – 15:30	M.J. Todd Rank-One-Update Methods for Matrix Optimization Problems (slides)
15:30 – 16:00	Coffee break
16:00 – 16:45	L. Vandenberghe Interior-point methods for nuclear norm minimization (slides)
16:45 – 17:30	P. Parrilo T.b.a.
17:45	Bus departure for Workshop dinner

Friday June 13^th, 2008

Invited talks

08:30 – 09:00	Coffee
09:00 – 09:45	F. Rendl A quadratic factorization approach for linear optimization with completely positive matrices (slides)
09:45 – 10:30	H. Wolkowicz Strong Duality, Complementarity, and Duality Gaps in Conic Convex Optimization (slides)
10:30 – 11:00	Coffee break
Young researchers session
11:00 – 11:30	E. Chlamtac Using SDP Hierarchies for Approximation Algorithms (slides)
11:30 – 12:00	N. Gvozdenovic Block-diagonal semidefinite programming hierarchies for 0/1 programming (slides)
12:00 – 12:30	F.M. de Oliveira Filho A generalization of the Lovász theta number to distance graphs on the sphere (slides)
12:30 – 14:00	Lunch
14:00 – 14:45	M. Kojima A Numerical Algorithm for Block-Diagonal Decomposition of Matrix *-Algebras (slides)
14:45 – 15:30	M. Muramatsu Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (slides)
15:30 – 16:00	Coffee break
16:00 – 16:45	J. de Loera Hilbert's Nullstellensatz and Testing Feasibility of Combinatorial Problems (slides)
16:45	Closing