Description
Instructor(s)/Supervisor(s)/Coordinator(s): Jianfeng CAIThis reading course discusses sum-of-squares (SOS) polynomial proofs and their applications in and connections to various fields of mathematics and computer science. SOS proofs try to bound polynomial optimization problems or show that polynomial systems of equations cannot be solved by using the fact that squared polynomials are non-negative. Searching for SOS proofs has turned out to be a powerful algorithmic technique that is now ubiquitous in applied mathematics and theoretical computer science. Students should seek approval from the course instructor to take this reading course.