Polynomial optimization is an important topic in mathematical programming theory and applications. It is often NP-hard. Recently, linear matrix inequality and semidefinite programming techqniues prove very efficient in finding global optimal solution for polynomial optimization problems. They bring interesting interations between mathematical areas like convex analysis, optimization theory, moment theory, and algebraic geometry. This workshop will introduce graduate students and young scholars to the mathematical tools required to do research in this area.
Saturday, March 20, 2010 - 10:00pm to Wednesday, March 24, 2010 - 9:59pm
Mathematics Department, UC San Diego, USA