Speaker: Jie Wang, Associate Researcher, Academy of Mathematics and Systems Science, Chinese Academy of Sciences

Date: January 19, 2024

Time: 10:00-11:00

Location: Tencent Meeting: 538-857-035

Sponsor: School of Mathematics, Shandong University

Abstract:

Polynomial optimization is an important class of non-convex optimization problems, and has a powerful modelling ability for both continuous and discrete optimization. Over the past two decades, the moment-SOS hierarchy has been well developed for globally solving polynomial optimization problems. However, the rapidly growing size of SDP relaxations arising from the moment-SOS hierarchy makes it computationally intractable for large-scale problems. In this talk, I will show that there are plenty of algebraic structures to be exploited to remarkably improve the scalability of the moment-SOS hierarchy, which leads to the new active research area of structured polynomial optimization.

For more information, please visit:

http://www.math.sdu.edu.cn/info/1020/19520.htm