Algebraic Geometry and Optimization


Minisymposium on Algebraic Geometry and Optimization

SIAM Conference, Darmstadt, May 16-19, 2011


The interplay of semidefinite programming and algebraic geometry has
recently led to new paradigms for solving or approximating hard
optimization problems. Many nonlinear optimization problems can be encoded
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.

Schedule of the whole conference

Strongly related parts of the conference

Monday, May 16 --> 2:15 - 4:15
Semidefinite Programming and Discrete Optimization

Monday, May 16 -->  4:30 - 6:30
Semidefinite Programmimg

Tuesday, May 17 -->  2:45 - 4:45
Semidefinite Programming and Applications

Wednesday, May 18 --> 2:15 - 4:15
Polynomial Optimization

Thursday, May 19 --> 9:30 - 11:30
Convex Relaxation and Applications

Thursday, May 19 --> 3:15 - 5:15
Recent Advances on Applications of SDP Relaxations

Thursday, May 19 --> 5:30 - 7:30
An Algebraic View of Sparse Optimization

Thursday, May 19 --> 5:30 - 7:30
Concurrent Session
Semidefinite Programming Approaches to Combinatorial Problems