Programme 


last update: March 15, 2005

The institute is open from Sunday 17h00 to Saturday morning after breakfast. Reception of  participants is possible on Sunday between 17h00 and 23h00.

Monday

7h00-9h00
Petit Déjeuner

9h00-9h50
Victoria Powers Minimizing polynomials on semialgebraic sets
10h00-10h15
Café

10h15-11h05
Bruce Reznick Extremal psd ternary sextic forms -- a progress report
11h15-12h05
Murray Marshall Representation of non-negative polynomials with finitely many zeros and
Error estimates in the optimization of degree two polynomials on a discrete hypercube
12h30
Déjeuner

16h00-16h30
Café

16h30-17h20
Alexander Prestel Archimedean quadratic modules
17h30-17h55
Marie-Françoise Roy The subdiscriminants of symmetric matrices are sums of squares
19h30
Dîner



Tuesday

7h00-9h00
Petit Déjeuner

9h00-9h50
Christian Berg On some new constructions of moment sequences
10h00-10h15
Café

10h15-11h05
Salma Kuhlmann Invariant moment problem
11h15-12h05
Florian-Horia Vasilescu Positive maps on spaces of fractions
12h30
Déjeuner

16h00-16h30
Café

16h30-17h20
Raul Curto Truncated moment problems Via Flat Extensions of Positive Matrices
17h30-17h55
Lawrence Fialkow An extremal truncated moment problem
18h00-18h25
Claus Scheiderer Moment problem and complexity
19h30
Dîner


Wednesday

7h00-9h00
Petit Déjeuner

9h00-9h50
Jean Bernard Lasserre SOS approximation of polynomials, nonnegative on a variety
10h00-10h15
Café

10h15-11h05
Yurii Nesterov Polynomial technique in combinatorial optimization
11h15-11h40
Masakazu Muramatsu Sums of Squares and Semidefinite Programming Relaxations
for  Polynomial Optimization Problems with Structured Sparsity

11h45-12h10
Javier Peña Computing the stability number of a graph via semidefinite programming
12h30
Déjeuner

19h30
Dîner


Wednesday afternoon is free.

Thursday

7h00-9h00
Petit Déjeuner

9h00-9h50
Monique Laurent Approximating polynomials on the simplex and
Approximating the stability number of a graph via sums of squares
10h00-10h15
Café

10h15-10h40
Etienne de Klerk A linear programming reformulation of the standard
quadratic optimization problem (joint work with Dima Pasechnik)
10h45-11h10
Thorsten Theobald Geometric radii computations and constrained optimization
of symmetric polynomials
11h15-12h05
Pablo Parillo Copositive and completely positive matrices,
Pólya meets De Finetti
12h30
Déjeuner

16h30-17h00
Café

17h00-17h50
Konrad Schmüdgen Variants of the Strict Positivstellensatz for Noncommutative Staralgebras
18h00-18h25
Jaka Cimprič Intersection theorems for quadratic modules on *-rings
19h30
Bouillabaisse


Friday

7h00-9h00
Petit Déjeuner

9h00-9h50
Leonid Faybusovich Universal barrier functions for cones generated by
Chebyshev systems and cones of squares
10h00-10h15
Café

10h15-11h05
Osman Güler Homogeneous cones
11h15-12h05
Roland Hildebrand Exactness of the PPT condition for 3x3 matrices and
Approximation of convex functions with cumulant generating functions
12h30
Déjeuner

19h30
Dîner


The conference ends on Friday noon. You can stay until Saturday morning after the breakfast.

Back