勷勤数学•专家报告

题      目：Recent Progress on Proximal Alternating Type Algorithm for Spherical Polynomial Optimization Problems

报  告  人： 陈海滨 教授  (邀请人：陈艳男)

                                                曲阜师范大学

时      间： 8月18日  10：00-11:00

地     点：数科院西楼二楼会议室

报告人简介:

          陈海滨，教授，博士生导师。中国运筹学会数学规划分会及算法软件及应用分会理事，CSIAM优化及应用专委会委员。主要从事张量与多项式优化等相关研究工作，主持国家自然科学基金2项，省部级项目6项，发表SCI论文60多篇，首位荣获山东省自然科学二等奖。

摘      要：

           In this report, we focus on spherical polynomial optimization problems (POPs). For homogeneous polynomials, we provide a concise proof of the equivalence between POPs and multi-block optimization problems (MOPs), and further demonstrate that POPs and MOPs share identical optimal solutions in the context of biquadratic programming. For inhomogeneous polynomials, to the best of our knowledge, the equivalence between POPs and MOPs has not yet been established in the literature. We bridge this gap by offering a simple proof of the equivalence for cubic spherical inhomogeneous polynomial optimization problems. Finally, we present several applications that illustrate the utility of the aforementioned results.

          欢迎老师、同学们参加、交流！