Printable PDF
Department of Mathematics,
University of California San Diego

****************************

Math 208 - Algebraic Geometry Seminar

Jiawang Nie

UC San Diego

Optimization, Positivstellensatz and Convex Algebraic Geometry

Abstract:

This talk is about optimizing polynomial functions under constraints. A general method is to apply the Moment-SOS hierarchy of semidefinite programming relaxations. The convergence is based on various Positivstellensatz. Closely related polynomial optimization is convex algebraic geometry. \\ \\ It concerns geometric properties of convex semialgebraic sets through semidefinite programming. We are going to review basic results for these topics.

Host: James McKernan

May 14, 2021

4:00 PM

Location / Remote Access URL: contact David Stapleton -dstapleton@ucsd.edu for zoom access

****************************