|
Jean B. Lasserre: The moment-sos approach
Abstract:
Amazingly, many problems can be seen as particular instances of the so-called generalized problem of moments (GPM, and Global Optimization is only among such poblems. When the GPM has polynomial data, I will show how to combine
-
results of real algebraic geometry obtained in the nineties, and
-
semidefinite programmig (a powerful technique of convex optimization),
to define a hierarchy of semidefinite programs whose associated monotone sequence of optimal values converges to the optimal value of the GPM.
|
