Graduate Student Seminar, 4:30pm November 11, 2002, Hayes-Healy 231


Guangyue Han


Minimizing Polynomial Functions


Several approaches can be taken to deal with minimization of gneral polynomial functions. It is demonstrated that existing algebraic methods (Grobner bases, resultants, homotopy continuation methods) are dramatically outperformed by a newly proposed technique which involves sums of squares and semidefinite programming. In this talk, I will review the algebraic methods which consider the critical points of the given target polynomial, then two semidefinite relaxation technique using sums of sqrares will be presented.

To volunteer to give a talk, or for any other questions regarding this schedule, contact Wesley Calvert