# Minisymposium on Algebraic Geometry and Conic Programming

**ISMP '12 Minisymposium on Algebraic Geometry and Conic ProgrammingBerlin, Germany, August 19 - 24, 2012 **

The interplay of conic programming and algebraic geometry has recently led to new paradigms for solving or approximating hard optimization problems. Many nonlinear optimization problems can be encoded for example into semidefinite programs through the theory of moments and positive polynomials. The basic idea underlying this approach is that, while testing whether a polynomial is nonnegative is a hard problem, the relaxed problem of testing whether it can be written as a sum of squares of polynomials can be reformulated as a semidefinite program. This symposium aims to highlight the various algebraic tools and methodologies behind this approach.