网站首页

前沿论坛

当前位置: 网站首页 > 前沿论坛 > 正文

[午夜试看120秒体验15次2024.1.27] Jae Hyoung Lee(研究员,韩国釜庆大学)
作者:   发布日期:2024-01-26   浏览次数:

标题:Bounded degree SOS (BSOS) hierarchies forseparable plus lower degree (SPLD)polynomials

报告时间:2024年01月27日(星期六)10:30-11:30

报告地点:惟真楼305

主讲人: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等学术期刊。