标题：Bounded degree SOS (BSOS) hierarchies forseparable plus lower degree (SPLD)polynomials
主讲人：Jae Hyoung Lee（韩国釜庆大学，研究员）
In this talk, we consider separable plus lower degree (SPLD) polynomials, by which we mean polynomials that have the decomposition of the sum of univariate polynomials (in different variables) and a polynomial whose degree is lower than the one of the separable polynomial. By taking the SPLD structure of polynomials into account, we propose a bounded degree SOS hierarchy, named by BSOS-SPLDP, to efficiently solve the optimization problems with SPLD polynomials, and several numerical experience perform much better than the bounded degree Lasserre hierarchy. Moreover, we observe that a polynomial consisting of a separable convex polynomial and an SOS-convex polynomial also admits the form of an SPLD polynomial, in which case a more tractable case is achieved.
Jae Hyoung Lee，韩国国立釜庆大学专任研究员，长期从事具有多项式结构的多目标优化等研究工作，取得了一系列的研究成果，相关工作发表在Mathematical Programming、SIAM Journal on Optimization等学术期刊。