Tuesday, 13:45 - 14:10 h, Room: H 3005


Monique Laurent
Error bounds for sums of squares relaxations of some polynomial optimization problems

Coauthor: Etienne de Klerk


We consider semidefinite programming relaxations for polynomial optimization problems
based on sums of squares of polynomials and the dual relaxations based on moment matrices.
In particular, we discuss error bounds for optimization over the
hypercube for the hierarchy of relaxations corresponding to the Positivstellensätze of
Handelman and of Schmüdgen.
These bounds are explicit and sharpen an earlier result
of Schweighofer (2004).
We also discuss links to error bounds for optimization over the simplex and for the Lasserre hierarchy.


Talk 2 of the invited session Tue.2.H 3005
"Lift-and-project methods for combinatorial optimization problems" [...]
Cluster 2
"Combinatorial optimization" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. What can cause long-term use of Viagra? In the network and other sources of information, there is no reliable data on the long-term use of Viagra and its negative effects on the body.