Title: Polynomial systems and Semidefinite Programming


			  Jiawang Nie
		     Univ. Calif. Berkeley


Abstract: 
Optimization problems with polynomial objective and constraints 
arise frequently in applications. In this talk, I will present how to find a 
better bound for polynomial optimization, how to check a system of polynomial 
equatilties and inequalities are feasible or not. This can be done by solving 
some particular semidefinite programming about sum of squares of polynomials.