标题：Optimization Involving Polynomials: Theory and Algorithms

报告人：黄磊（ University of California San Diego）

时间：2026年6月17日（周三）10:00-11:00

地点：文北楼102教室

摘要：The Moment--SOS hierarchy proposed by Jean B. Lasserre is a fundamental method for globally solving optimization problems involving polynomials, such as polynomial optimization (PO), polynomial matrix optimization (PMO), and the generalized moment problem (GMP). While this method has proved powerful in practice, the existing convergence theory mainly explains its practical performance for PO and typically relies on compactness assumptions. In this talk, we present our recent work on the convergence analysis for PMO and GMP, as well as convenient convergent relaxations for unbounded problems. These results lead to the resolution of several open questions.

个人简介：Dr. Lei Huang is currently a Visiting Assistant Professor at the University of California San Diego. He received his Ph.D. from the Academy of Mathematics and Systems Science, CAS, in 2023, and his bachelor's degree from Wuhan University in 2018. His research interests include polynomial optimization, convex algebraic geometry, and semidefinite programming. His work has been published in leading optimization journals, including Math. Program. and SIAM J. Optim., and has resolved several open questions.

邀请人：周坚