关于举行杭州电子科技大学凌晨教授学术报告的通知

报告题目：Generalized polynomial complementarity problems with structured tensors
报 告 人：凌晨  教授（杭州电子科技大学）
报告时间：2017年12月25日（星期一）下午15:30-17:00
邀 请 人：潘少华  教授
报告地点：四号楼4318室

欢迎广大师生前往！

                                                                    数学学院
                                                                 2017年12月19日

报告摘要：In this talk, we consider the generalized polynomial complementarity problem (GPCP), which covers the recently introduced polynomial complementarity problem (PCP) and the well studied tensor complementarity problem (TCP) as special cases. By exploiting structure of tensors, we first show that the solution set of GPCPs is nonempty and compact when a pair of leading tensors is cone ER. Then, we study some topological properties of the solution set of GPCPs under the condition that the leading tensor pair is cone $R^0$ . Finally, we study a notable global Lipshitzian error bound of the solution set of GPCPs, which is better than the results obtained in the current PCPs and TCPs literature and also is beneficial for finding and analyzing numerical solutions to the problem under consideration.

报告人简介：凌晨，杭州电子科技大学理学院教授、博导，现任中国运筹学会理事、中国系统工程学会理事、中国运筹学会数学规划分会常务理事；中国经济数学与管理数学研究会副理事长。第一、二届浙江省教育厅高等数学教学指导委员会委员。主要研究兴趣包括:非线性规划、变分不等式与互补问题、多变量多项式优化、张量理论与计算等。在Math. Program.、SIAM J.Optim.等国内外重要学术期刊上发表论文60余篇。主持国家自然科学基金项目和浙江省自然科学重点项目多项。